Multi-depot multiple TSP: a polyhedral study and computational results

DOI10.1007/s10479-011-1024-yzbMath1272.90065MaRDI QIDQ367624

Mohammad Hasan, M. Dambrine, H. S. Yoon

Publication date: 16 September 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-1024-y

zbMATH Keywords

polyhedral study; Branch-and-Cut; multiple depot traveling salesman problem

Mathematics Subject Classification ID

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Uses Software

• TSPLIB
• Concorde