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. © 2012 Springer-Verlag.
CITATION STYLE
Borne, S., Grappe, R., & Lacroix, M. (2012). The uncapacitated asymmetric traveling salesman problem with multiple stacks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7422 LNCS, pp. 105–116). https://doi.org/10.1007/978-3-642-32147-4_11
Mendeley helps you to discover research relevant for your work.