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
Efficient algorithms for the double traveling salesman problem with multiple stacks
Computers and Operations Research
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
Theoretical Computer Science
Traveling salesman problem under categorization
Operations Research Letters
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
INFORMS Journal on Computing
Differential approximation of the multiple stacks TSP
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |
In the uncapacitated asymmetric traveling salesman problem with multiple stacks, one first performs a hamiltonian circuit to pick up n items, storing them in a vehicle with k stacks satisfying last-in-first-out constraints, and then delivers every item by performing a second hamiltonian circuit. Here, we are interested in the convex hull of the arc-incidence vectors of such couples of hamiltonian circuits. For the general case, we determine the dimension of this polytope, and show that every facet of the asymmetric traveling salesman polytope defines one of its facets. For the special case with two stacks, we provide an integer linear programming formulation whose linear relaxation is polynomial-time solvable, and we propose new families of valid inequalities to reinforce the latter.