The maximum k-colorable subgraph problem for chordal graphs
Information Processing Letters
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Improved Time Bounds for Permutation Graph Problems
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
The mutual exclusion scheduling problem for permutation and comparability graphs
Information and Computation
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
Networks - Special Issue In Memory of Stefano Pallottino
Ant colony optimization for the two-dimensional loading vehicle routing problem
Computers and Operations Research
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints
Transportation Science
INFORMS Journal on Computing
The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
Computers and Operations Research
On the Complexity of the Multiple Stack TSP, kSTSP
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
Computers and Operations Research
The uncapacitated asymmetric traveling salesman problem with multiple stacks
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach
Computers and Operations Research
| Hi-index | 0.01 |
In this paper we investigate theoretical properties of the Double Traveling Salesman Problem with Multiple Stacks. In particular, we provide polynomial time algorithms for different subproblems when the stack size limit is relaxed. Since these algorithms can represent building blocks for more complex methods, we also include them in a simple heuristic which we test experimentally. We finally analyze the impact of handling the stack size limit, and we propose repair procedures. The theoretical investigation highlights interesting structural properties of the problem, and our computational results show that the single components of the heuristic can be successfully incorporated in more complex algorithms or bounding techniques.