Integer programming approaches to the travelling salesman problem

DOI10.1007/BF01580682MaRDI QIDQ4105495zbMATH OpenOpenAlexFDO

Authors

Publication date 1976

Published in Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Integer programming (90C10)

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• An Algorithm for the Traveling Salesman Problem
• scientific article; zbMATH DE number 3438384 (Why is no real title available?)
• scientific article; zbMATH DE number 3392490 (Why is no real title available?)
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Integer Programming Formulation of Traveling Salesman Problems
• Maximum matching and a polyhedron with 0,1-vertices
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms
• The Traveling Salesman Problem: A Survey
• The traveling-salesman problem and minimum spanning trees: Part II

Cited in

(17)

• 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
• Minimum tiling of a rectangle by squares
• Heuristic methods and applications: A categorized survey
• The symmetric travelling salesman problem. II: New low bounds
• Generating subtour elimination constraints for the TSP from pure integer solutions
• 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
• The Boolean quadric polytope
• A branch and bound algorithm for the capacitated vehicle routing problem
• The solution of some 100-city travelling salesman problems
• Some contributions of Ailsa H. Land to the study of the traveling salesman problem
• Fifty years of operational research: 1972--2022
• New strategy for anti-loop formulations

This page was built for publication: Integer programming approaches to the travelling salesman problem

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