Using cutting planes to solve the symmetric Travelling Salesman problem

DOI10.1007/BF01609016zbMATH Open0393.90059MaRDI QIDQ4175048FDOQ4175048

Authors:

Publication date: 1978

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

zbMATH Keywords

Computational EfficiencyCutting PlanesSymmetric Travelling Salesman ProblemCombinatorial Problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Boolean programming (90C09)

Cites Work

• A Dynamic Programming Approach to Sequencing Problems
• Title not available (Why is that?)
• The traveling-salesman problem and minimum spanning trees: Part II
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integer programming approaches to the travelling salesman problem
• The Traveling Salesman Problem: A Survey
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
• Title not available (Why is that?)

Cited In (15)

• A new class of cutting planes for the symmetric travelling salesman problem
• A cutting plane procedure for the travelling salesman problem on road networks
• An exact algorithm for minimizing routing and operating costs in depot location
• A tutorial on branch and cut algorithms for the maximum stable set problem
• The traveling salesman problem: An overview of exact and approximate algorithms
• Some contributions of Ailsa H. Land to the study of the traveling salesman problem
• Distance conserving reductions for nonoriented networks
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints
• Design of electricity supply networks
• Gomory cuts revisited
• Coordinating particle swarm optimization, ant colony optimization and \(K\)-Opt algorithm for traveling salesman problem
• Hamiltonian location problems
• Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm
• The solution of some 100-city travelling salesman problems
• Classical cuts for mixed-integer programming and branch-and-cut

This page was built for publication: Using cutting planes to solve the symmetric Travelling Salesman problem

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