LP-based solution methods for the asymmetric TSP

DOI10.1016/j.ipl.2006.10.002zbMath1184.68645OpenAlexW1989453147MaRDI QIDQ845937

Vardges Melkonian

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.10.002

zbMATH Keywords

TSPlinear programmingnetwork flowsapproximation algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A factor 2 approximation algorithm for the generalized Steiner network problem
• Geometric algorithms and combinatorial optimization
• On the approximability of the traveling salesman problem (extended abstract)
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
• Algorithms for a network design problem with crossing supermodular demands

This page was built for publication: LP-based solution methods for the asymmetric TSP