Parallel variable neighbourhood search strategies for the cutwidth minimization problem
Year of publication: |
January 2016
|
---|---|
Authors: | Duarte, Abraham ; Pantrigo, Juan J. ; Pardo, Eduardo G. ; Sánchez-Oro, Jesús |
Published in: |
IMA journal of management mathematics. - Oxford : Oxford Univ. Press, ISSN 1471-678X, ZDB-ID 2074812-7. - Vol. 27.2016, 1, p. 55-73
|
Subject: | variable neighbourhood search | variable formulation search | parallel designs | cutwidth minimization problem | Suchtheorie | Search theory | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | USA | United States | Theorie | Theory | Nachbarschaft | Neighbourhood |
-
A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
Žulj, Ivan, (2018)
-
A large neighbourhood search heuristic for covering designs
Nikolić, Nebojša D., (2016)
-
An adaptive large neighborhood search heuristic for the share-a-ride problem
Li, Baoxiang, (2016)
- More ...
-
Scatter search for the cutwidth minimization problem
Pantrigo, Juan J., (2012)
-
Branch and bound for the cutwidth minimization problem
Martí, Rafael, (2013)
-
Scatter search for the cutwidth minimization problem
Pantrigo, Juan J., (2012)
- More ...