Sciweavers

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

6

DISOPT
2006

favoriteEmaildiscussreport

46views more DISOPT 2006»

Iterative patching and the asymmetric traveling salesman problem

13 years 4 months ago

Iterative patching and the asymmetric traveling salesman problem

Download dissertations.ub.rug.nl

Marcel Turkensteen, Diptesh Ghosh, Boris Goldengor

Real-time Traffic

DISOPT 2006 |

claim paper

Related Content

» The Asymmetric Traveling Salesman Problem Algorithms Instance Generators and Tests

» Metaheuristics for the Asymmetric Hamiltonian Path Problem

» Tolerance Based ContractorPatch Heuristic for the Asymmetric TSP

» Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Tra...

» On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem

» New facets of the STS polytope generated from known facets of the ATS polytope

» 3544Approximation for Asymmetric Maximum TSP with Triangle Inequality

» An Olog nlog log napproximation algorithm for the asymmetric traveling salesman problem

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

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DISOPT
Authors	Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma

Comments (0)