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

DOI10.1007/978-3-642-14355-7_13MaRDI QIDQ3578366zbMATH OpenOpenAlexFDO

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

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)

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
• scientific article; zbMATH DE number 1947373
• Good triangulations yield good tours

Cited in

(2)

• Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges
• A tolerance-based heuristic approach for the weighted independent set problem

Describes a project that uses

Uses Software

• Concorde

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)