Integer programming approaches to the travelling salesman problem

DOI10.1007/BF01580682zbMath0337.90041MaRDI QIDQ4105495

No author found.

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C10: Integer programming

90C05: Linear programming

Related Items

A branch and bound algorithm for the capacitated vehicle routing problem, An exact algorithm for minimizing routing and operating costs in depot location, The traveling salesman problem: An overview of exact and approximate algorithms, The seriation problem and the travelling salesman problem, Heuristic methods and applications: A categorized survey, Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach, Two exact algorithms for the distance-constrained vehicle routing problem, The use of relaxation techniques to solve certain mathematical decision‐making problems, Using cutting planes to solve the symmetric Travelling Salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Integer Programming Formulation of Traveling Salesman Problems
• A Dynamic Programming Approach to Sequencing Problems
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
• Maximum matching and a polyhedron with 0,1-vertices
• An Algorithm for the Traveling Salesman Problem
• The Traveling Salesman Problem: A Survey
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms
• The traveling-salesman problem and minimum spanning trees: Part II
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey