A cutting plane procedure for the travelling salesman problem on road networks
From MaRDI portal
Publication:1072449
DOI10.1016/0377-2217(85)90151-1zbMath0586.90083OpenAlexW1975467430MaRDI 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 solutioninteger linear programmingcutting plane algorithmsymmetric travelling salesmanincomplete road network
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)
Related Items
The time-dependent shortest path and vehicle routing problem, ILP formulation of the degree-constrained minimum spanning hierarchy problem, The Steiner traveling salesman problem with online edge blockages, Good triangulations yield good tours, Pricing routines for vehicle routing with time windows on road networks, Empirical analysis for the VRPTW with a multigraph representation for the road network, The Steiner traveling salesman problem with online advanced edge blockages, A new class of cutting planes for the symmetric travelling salesman problem, On the graphical relaxation of the symmetric traveling salesman polytope, Vehicle routing on road networks: how good is Euclidean approximation?, An efficient and general approach for the joint order batching and picker routing problem, Optimally solving the joint order batching and picker routing problem, Upgrading edges in the graphical TSP, Safe and secure vehicle routing: a survey on minimization of risk exposure, A note on computational aspects of the Steiner traveling salesman problem, Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks, Improving a constructive heuristic for the general routing problem, Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows, Traveling salesman path problems, The Steiner traveling salesman problem and its extensions, Exact algorithms for the order picking problem, Recent results on Arc Routing Problems: An annotated bibliography, Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs, Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm, A new integer programming formulation of the graphical traveling salesman problem, Hamiltonian path and symmetric travelling salesman polytopes, A new integer programming formulation of the graphical traveling salesman problem, The general routing polyhedron: A unifying framework, An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem, New inequalities for the general routing problem, Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories, The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra, Circular Jaccard distance based multi-solution optimization for traveling salesman problems, Survey of facial results for the traveling salesman polytope, A note on finding a shortest complete cycle in an undirected graph, Compact formulations of the Steiner traveling salesman problem and related problems
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
