Models for Solving the Travelling Salesman Problem

DOI10.1007/11493853_3MaRDI QIDQ5450918zbMATH OpenOpenAlexFDO

Authors H. P. Williams

Publication date 17 March 2008

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11493853_3

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 795217
• A concise guide to the Traveling Salesman Problem
• Traveling salesman problem with transportation
• The traveling salesman problem. I: Theoretical issues
• A new integer programming formulation of the graphical traveling salesman problem

Cited in

(8)

• A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
• Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems
• Component model for a NP-hard problem
• Teaching Integer Programming Formulations Using the Traveling Salesman Problem
• A new integer programming formulation of the graphical traveling salesman problem
• A new integer programming formulation of the graphical traveling salesman problem
• Exact models for the flying sidekick traveling salesman problem
• Cost allocation: The traveling salesman, bin packing, and the knapsack

This page was built for publication: Models for Solving the Travelling Salesman Problem

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