A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
Year of publication: |
2013
|
---|---|
Authors: | Alba Martínez, Manuel A. ; Cordeau, Jean-François ; Dell'Amico, Mauro ; Iori, Manuel |
Published in: |
INFORMS journal on computing : JOC. - Linthicum, Md : INFORMS, ISSN 0899-1499, ZDB-ID 13160771. - Vol. 25.2013, 1, p. 41-55
|
Saved in:
Saved in favorites
Similar items by person
-
A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
Martínez, Manuel A. Alba, (2013)
-
The bike sharing rebalancing problem: Mathematical formulations and benchmark instances
Dell'Amico, Mauro, (2014)
-
Lower bounds and heuristic algorithms for the ki-partitioning problem
Dell'Amico, Mauro, (2006)
- More ...