Using cutting planes to solve the symmetric Travelling Salesman problem
From MaRDI portal
Publication:4175048
DOI10.1007/BF01609016zbMath0393.90059MaRDI QIDQ4175048
No author found.
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Paths and cycles (05C38) Boolean programming (90C09)
Related Items
A new class of cutting planes for the symmetric travelling salesman problem, Distance conserving reductions for nonoriented networks, 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, Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem, Design of electricity supply networks, Hamiltonian location problems, Classical cuts for mixed-integer programming and branch-and-cut, The traveling salesman problem: An overview of exact and approximate algorithms, A tutorial on branch and cut algorithms for the maximum stable set problem, Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm, Gomory cuts revisited, An efficient genetic algorithm for the traveling salesman problem with precedence constraints, A cutting plane procedure for the travelling salesman problem on road networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Dynamic Programming Approach to Sequencing Problems
- Integer programming approaches to the travelling salesman problem
- Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
- The Traveling Salesman Problem: A Survey
- The traveling-salesman problem and minimum spanning trees: Part II
