Traveling salesman path problems
From MaRDI portal
Publication:2476987
DOI10.1007/S10107-006-0046-8zbMATH Open1135.90039OpenAlexW1976231547MaRDI QIDQ2476987FDOQ2476987
Authors: Fumei Lam, Alantha Newman 
Publication date: 12 March 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0046-8
Recommendations
- Traveling salesman problem
- scientific article; zbMATH DE number 1947373
- scientific article; zbMATH DE number 795217
- The traveling-salesman problem
- scientific article; zbMATH DE number 6011205
- On the solution of traveling salesman problems
- Aspects of the traveling salesman problem
- The traveling salesman problem and its variations
Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Cites Work
- polymake: a framework for analyzing convex polytopes
- A cutting plane procedure for the travelling salesman problem on road networks
- The traveling salesman problem on a graph and some related integer polyhedra
- The traveling salesman problem and its variations
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Title not available (Why is that?)
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- The Steiner tree polytope and related polyhedra
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
- The traveling salesman problem in graphs with some excluded minors
- Traveling salesman path problems
- Title not available (Why is that?)
Cited In (13)
- The traveling salesman problem in graphs with some excluded minors
- An LP-based approximation algorithm for the generalized traveling salesman path problem
- Pyramidal traveling salesman problem
- The Directed Minimum Latency Problem
- Traveling salesman problem
- A LP-based approximation algorithm for generalized traveling salesperson path problem
- Cut dominants and forbidden minors
- Directed travelling salesman problem
- Traveling salesman path problems
- Title not available (Why is that?)
- Approximation algorithms with constant ratio for general cluster routing problems
- Approximation algorithms for general cluster routing problem
- Travelling salesman paths on Demidenko matrices
Uses Software
This page was built for publication: Traveling salesman path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476987)
