Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

85

Voted

TOC
2008

favoriteEmaildiscussreport

95views more TOC 2008»

On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem

14 years 10 months ago

On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem

Download theoryofcomputing.org

: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P

Viswanath Nagarajan

Real-time Traffic

Corrected Linear Relaxation | LP Relaxation | Salesman Path Problem | TOC 2008 |

claim paper

Related Content

» Asymmetric Traveling Salesman Path and Directed Latency Problems

» A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem

» When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem

» Metaheuristics for the Asymmetric Hamiltonian Path Problem

» Tolerance Based ContractorPatch Heuristic for the Asymmetric TSP

» Approximating the asymmetric profitable tour

» A branch and bound method for the jobshop problem with sequencedependent setup times

» Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs

» Greedytype resistance of combinatorial problems

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TOC
Authors	Viswanath Nagarajan

Comments (0)