A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
From MaRDI portal
Publication:3541797
DOI10.1007/978-3-540-85363-3_17zbMath1159.90478MaRDI QIDQ3541797
No author found.
Publication date: 27 November 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_17
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Cites Work
- A factor 2 approximation algorithm for the generalized Steiner network problem
- The traveling salesman problem and its variations
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems
- Survivable network design with degree or order constraints
- Approximating minimum bounded degree spanning trees to within one of optimal
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item