MaxMinMin p-dispersion problem : a variable neighborhood search approach
Year of publication: |
2014
|
---|---|
Authors: | Saboonchi, Behnaz ; Hansen, Pierre ; Perron, Sylvain |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 52.2014, B, p. 251-259
|
Subject: | Combinatorial optimization | Dispersion problems | Metaheuristics | Variable Neighborhood Search | Theorie | Theory | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Nachbarschaft | Neighbourhood | Wohnstandort | Residential location |
-
A generalized consistent neighborhood search for satellite range scheduling problems
Zufferey, Nicolas, (2015)
-
Random partial neighborhood search for the post-enrollment course timetabling problem
Nagata, Yuichi, (2018)
-
Zhao, Juntao, (2025)
- More ...
-
Algorithms for ℓ<Subscript>1</Subscript>-Embeddability and Related Problems
Hansen, Pierre, (2007)
-
Exact and heuristic solutions of the global supply chain problem with transfer pricing
Perron, Sylvain, (2010)
-
The small hexagon and heptagon with maximum sum of distances between vertices
Audet, Charles, (2011)
- More ...