The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks

DOI10.1007/978-3-642-32147-4_11MaRDI QIDQ3167617zbMATH OpenOpenAlexFDO

Authors Sylvie Borne, Roland Grappe, Mathieu Lacroix

Publication date 2 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32147-4_11

zbMATH Keywords

asymmetric traveling salesman problemfacetsformulationpolytopestacksvalid inequalities

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Approximation of the double traveling salesman problem with multiple stacks
• The asymmetric traveling salesman problem with replenishment arcs
• Exact solutions to the double travelling salesman problem with multiple stacks
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• A note on the complexity of the asymmetric traveling salesman problem
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• The undirected \(m\)-capacitated peripatetic salesman problem

Cited in

(3)

• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
• High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system
• A set covering approach for the double traveling salesman problem with multiple stacks

This page was built for publication: The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167617)