A cutting plane procedure for the travelling salesman problem on road networks
From MaRDI portal
Publication:1072449
DOI10.1016/0377-2217(85)90151-1zbMath0586.90083MaRDI QIDQ1072449
Publication date: 1985
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(85)90151-1
exact solution; integer linear programming; cutting plane algorithm; symmetric travelling salesman; incomplete road network
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C10: Integer programming
Related Items
On the graphical relaxation of the symmetric traveling salesman polytope, A note on finding a shortest complete cycle in an undirected graph, A new class of cutting planes for the symmetric travelling salesman problem, New inequalities for the general routing problem, The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra, Survey of facial results for the traveling salesman polytope, Hamiltonian path and symmetric travelling salesman polytopes, The general routing polyhedron: A unifying framework, Good triangulations yield good tours, Traveling salesman path problems, Recent results on Arc Routing Problems: An annotated bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for the capacitated vehicle routing problem
- Distance conserving reductions for nonoriented networks
- On the symmetric travelling salesman problem I: Inequalities
- A Dynamic Programming Approach to Sequencing Problems
- Two exact algorithms for the distance-constrained vehicle routing problem
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- On the symmetric travelling salesman problem: A computational study
- A Cutting Planes Algorithm for the m-Salesmen Problem
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Using cutting planes to solve the symmetric Travelling Salesman problem
- Solution of a Large-Scale Traveling-Salesman Problem
- The solution of some 100-city travelling salesman problems
