A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
Year of publication: |
2013
|
---|---|
Authors: | Martínez, Manuel A. Alba ; Cordeau, Jean-François ; Dell'Amico, Mauro ; Iori, Manuel |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 25.2013, 1, p. 41-55
|
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 ...
-
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
Alba Martínez, Manuel A., (2013)
-
Heuristic and exact algorithms for the identical parallel machine scheduling problem
Dell'Amico, Mauro, (2008)
-
The single-finger keyboard layout problem
Dell'Amico, Mauro, (2009)
- More ...