A new integer programming formulation of the graphical traveling salesman problem
From MaRDI portal
Publication:5925646
DOI10.1007/s10107-022-01849-wOpenAlexW3034945476MaRDI QIDQ5925646
No author found.
Publication date: 14 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-022-01849-w
relaxationtraveling salesman problemlinear programintegrality gapseparation algorithmgraphical traveling salesman problem
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compact formulations of the Steiner traveling salesman problem and related problems
- A note on finding a shortest complete cycle in an undirected graph
- A cutting plane procedure for the travelling salesman problem on road networks
- Using separation algorithms to generate mixed integer model reformulations
- Expressing combinatorial optimization problems by linear programs
- Compact vs. exponential-size LP relaxations
- Compact extended linear programming models
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems
- Worst-case comparison of valid inequalities for the TSP
- The traveling salesman problem and its variations.
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
- On the symmetric travelling salesman problem I: Inequalities
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- The traveling salesman problem on a graph and some related integer polyhedra
- Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Matching, Euler tours and the Chinese postman
- On the Relation Between the Traveling-Salesman and the Longest-Path Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- A cutting plane algorithm for the general routing problem
