Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
Year of publication: |
2010
|
---|---|
Authors: | Cordeau, Jean-Franc̦ois ; Dell'Amico, Mauro ; Iori, Manuel |
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. 37.2010, 5, p. 970-980
|
Subject: | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Heuristik | Heuristics | Algorithmus | Algorithm | Theorie | Theory |
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
Review of solution approaches for the symmetric traveling salesman problem
Saharidis, Georgios K. D., (2014)
-
Baltz, Andreas, (2015)
- More ...
-
The single-finger keyboard layout problem
Dell'Amico, Mauro, (2009)
-
The bike sharing rebalancing problem : mathematical formulations and benchmark instances
Dell'Amico, Mauro, (2014)
-
A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
Martínez, Manuel A. Alba, (2013)
- More ...