The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks

DOI10.1007/978-3-642-32147-4_11zbMath1370.90205OpenAlexW185619668MaRDI QIDQ3167617

Mathieu Lacroix, Roland Grappe, Sylvie Borne

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

stackspolytopevalid inequalitiesasymmetric traveling salesman problemfacetsformulation

Mathematics Subject Classification ID

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

Related Items (2)

Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks ⋮ 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