Results 241 to 250 of about 221,965 (288)
Some of the next articles are maybe not open access.

Variable neighborhood search: Principles and applications

European Journal of Operational Research, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hansen, Pierre, Mladenović, Nenad
openaire   +4 more sources

Variable neighborhood search for location routing

Computers & Operations Research, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jarboui, Bassem   +3 more
openaire   +3 more sources

Variable neighborhood search and local branching

Computers & Operations Research, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hansen, Pierre   +2 more
openaire   +4 more sources

Variable Neighborhood Decomposition Search

Journal of Heuristics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hansen, Pierre   +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   +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   +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

Home - About - Disclaimer - Privacy