Efficient algorithms for the double traveling salesman problem with multiple stacks
Year of publication: |
2012
|
---|---|
Authors: | Casazza, Marco ; Ceselli, Alberto ; Nunkesser, Marc |
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. 39.2012, 5, p. 1044-1053
|
Subject: | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm |
-
Baltz, Andreas, (2015)
-
The interval min-max regret knapsack packing-delivery problem
Wang, Shijin, (2021)
-
Tabu search for solving the black-and-white travelling salesman problem
Li, Haitao, (2016)
- More ...
-
Optimizing the Cargo Express service of Swiss Federal Railways
Ceselli, Alberto, (2008)
-
Optimizing the Cargo Express Service of Swiss Federal Railways
Ceselli, Alberto, (2008)
-
Mathematical programming algorithms for bin packing problems with item fragmentation
Casazza, Marco, (2014)
- More ...