Results 241 to 250 of about 221,092 (272)

Dynamic optimization of stand structure in <i>Pinus yunnanensis</i> secondary forests based on deep reinforcement learning and structural prediction. [PDF]

Front Plant Sci
Zhao J, Wang J, Yin J, Chen Y, Wu B.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Variable Neighborhood Decomposition Search

Journal of Heuristics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hansen, Pierre, Mladenović, Nenad, Perez-Brito, Dionisio   +2 more
openaire   +2 more sources

Collaborative Variable Neighborhood Search

2018
Variable neighborhood search (VNS) is a well-known metaheuristic. Two main ingredients are needed for its design: a collection \(M=(N_1, \ldots , N_r)\) of neighborhood structures and a local search LS (often using its own single neighborhood L). M has a diversification purpose (search for unexplored zones of the solution space S), whereas LS plays an ...
Zufferey, Nicolas, Gallay, Olivier
openaire   +2 more sources

Scheduled penalty Variable Neighborhood Search

Computers & Operations Research, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barrett W. Thomas, MANNI, Emanuele
openaire   +1 more source

A variable neighborhood search for graph coloring

European Journal of Operational Research, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Avanthay, Cédric, Hertz, Alain, Zufferey, Nicolas   +2 more
openaire   +2 more sources

Variable Neighborhood Search

2016
The Variable Neighborhood Search (VNS) metaheuristic was invented by Nenad Mladnovic and Pierre Hansen and developped at GERAD (Group for Research in Decision Analysis, Montral) since ...
Caporossi, Gilles, Hansen, Pierre, Mladenovic, Nenad   +2 more
openaire   +1 more source

Variable neighborhood search for the p-median

Location Science, 1997
Summary: Consider a set \(L\) of potential locations for \(p\) facilities and a set \(U\) of locations of given users. The \(p\)-median problem is to locate simultaneously the \(p\) facilities at locations of \(L\) in order to minimize the total transportation cost for satisfying the demand of the users, each supplied from its closest facility.
Hansen, P., Mladenović, N.
openaire   +2 more sources

Variable neighborhood search for the heaviest -subgraph

Computers & Operations Research, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brimberg, Jack, Mladenović, Nenad, Urošević, Dragan, Ngai, Eric   +3 more
openaire   +2 more sources

Tabu Variable Neighborhood Search for Designing DNA Barcodes

IEEE Transactions on NanoBioscience, 2020
Massively parallel sequencing, a popular and efficient sequencing method, produces a tremendous number of sequences from multiple individual samples. Labeling sequences with barcodes (tags) prevents them from being unrecoverable or confused during sequencing, replication, and oligonucleotide synthesis.
Bin Wang, Qiang Zhang, Xiaopeng Wei
openaire   +2 more sources

Variable Neighborhood Search

2019
This book constitutes the refereed post-conference proceedings of the 6th International Conference on Variable Neighborhood Search, ICVNS 2018, held in Sithonia, Greece, in October 2018. ICVNS 2018 received 49 submissions of which 23 full papers were carefully reviewed and selected.
openaire   +1 more source