Using cutting planes to solve the symmetric Travelling Salesman problem

DOI10.1007/BF01609016zbMath0393.90059MaRDI QIDQ4175048

No author found.

Publication date: 1978

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

zbMATH Keywords

Computational Efficiency; Cutting Planes; Symmetric Travelling Salesman Problem; Combinatorial Problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C35: Extremal problems in graph theory

65K05: Numerical mathematical programming methods

05C38: Paths and cycles

90C09: Boolean programming

Related Items

Classical cuts for mixed-integer programming and branch-and-cut, Distance conserving reductions for nonoriented networks, A cutting plane procedure for the travelling salesman problem on road networks, A new class of cutting planes for the symmetric travelling salesman problem, An exact algorithm for minimizing routing and operating costs in depot location, Design of electricity supply networks, Hamiltonian location problems, The traveling salesman problem: An overview of exact and approximate algorithms, An efficient genetic algorithm for the traveling salesman problem with precedence constraints, Gomory cuts revisited

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item