Generating subtour elimination constraints for the TSP from pure integer solutions

DOI10.1007/s10100-016-0437-8zbMath1364.90296arXiv1511.03533OpenAlexW2249534008WikidataQ41071821 ScholiaQ41071821MaRDI QIDQ2358189

Ulrich Pferschy, Rostislav Staněk

Publication date: 21 June 2017

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.03533

zbMATH Keywords

traveling salesman problemsubtour elimination constraintILP solverrandom Euclidean graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (7)

Generating subtour elimination constraints for the TSP from pure integer solutions ⋮ Minimization and maximization versions of the quadratic travelling salesman problem ⋮ Searching for a cycle with maximum coverage in undirected graphs ⋮ A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings ⋮ On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms ⋮ Geometric and LP-based heuristics for angular travelling salesman problems in the plane ⋮ The clustered team orienteering problem

Uses Software

• TSPLIB
• SCIP
• LKH
• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SCIP: solving constraint integer programs
• Solution of large-scale symmetric travelling salesman problems
• An efficient algorithm for the minimum capacity cut problem
• A comparative analysis of several asymmetric traveling salesman problem formulations
• A matching problem and subadditive Euclidean functionals
• The traveling salesman. Computational solutions for RSP applications
• Probability theory of classical Euclidean optimization problems
• Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Generating subtour elimination constraints for the TSP from pure integer solutions
• The traveling salesman problem and its variations.
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Integer programming approaches to the travelling salesman problem
• Random Geometric Graphs
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: Generating subtour elimination constraints for the TSP from pure integer solutions