Integer programming approaches to the travelling salesman problem
From MaRDI portal
Publication:4105495
DOI10.1007/BF01580682zbMath0337.90041OpenAlexW2070357213MaRDI QIDQ4105495
No author found.
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580682
Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)
Related Items
Generating subtour elimination constraints for the TSP from pure integer solutions, The Boolean Quadric Polytope, Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach, An exact algorithm for minimizing routing and operating costs in depot location, The solution of some 100-city travelling salesman problems, Some contributions of Ailsa H. Land to the study of the traveling salesman problem, The symmetric travelling salesman problem. II: New low bounds, Minimum tiling of a rectangle by squares, The traveling salesman problem: An overview of exact and approximate algorithms, Two exact algorithms for the distance-constrained vehicle routing problem, The use of relaxation techniques to solve certain mathematical decision‐making problems, A branch and bound algorithm for the capacitated vehicle routing problem, The seriation problem and the travelling salesman problem, Using cutting planes to solve the symmetric Travelling Salesman problem, Heuristic methods and applications: A categorized survey
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