Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
Year of publication: |
2016
|
---|---|
Authors: | Letchford, Adam N. ; Salazar-González, Juan-José |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 251.2016, 1 (16.5.), p. 74-84
|
Subject: | Sequential ordering | Travelling salesman problem with precedence constraints | Multi-commodity flows | Metrics | Polyhedral combinatorics | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Rundreiseproblem | Travelling salesman problem | USA | United States | Theorie | Theory |
-
Heuristics based on spacefilling curves for combinatorial problems in Euclidean space
Bartholdi, John J., (1988)
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
Iterated local search for the label printing problem
Alonso-Pecina, Federico, (2024)
- More ...
-
Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
Letchford, Adam N., (2015)
-
Decorous lower bounds for minimum linear arrangement
Caprara, Alberto, (2011)
-
The Capacitated Vehicle Routing Problem : stronger bounds in pseudo-polynomial time
Letchford, Adam N., (2019)
- More ...