Finding good tours for huge Euclidean TSP instances by iterative backbone contraction

DOI10.1007/978-3-642-14355-7_13zbMATH Open1286.90124OpenAlexW1675675212MaRDI QIDQ3578366FDOQ3578366

Christian Ernst, Dirk Richter, Gerold Jäger, Paul Molitor, Changxing Dong

Publication date: 20 July 2010

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14355-7_13

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (1)

• A tolerance-based heuristic approach for the weighted independent set problem

Uses Software

• Concorde

   Recommendations

• Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem 👍 👎
• Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP 👍 👎
• Edge Elimination in TSP Instances 👍 👎
• Title not available (Why is that?) 👍 👎
• Good triangulations yield good tours 👍 👎

This page was built for publication: Finding good tours for huge Euclidean TSP instances by iterative backbone contraction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578366)