Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP

DOI10.1007/978-3-540-72845-0_11MaRDI QIDQ5432314zbMATH OpenOpenAlexFDO

Authors Vladimir G. Deineko, Alexander Tiskin

Publication date 2 January 2008

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72845-0_11

Mathematics Subject Classification ID

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

Recommendations

• Fast minimum-weight double-tree shortcutting for metric TSP, Is the best one good enough?
• Min-weight double-tree shortcutting for metric TSP: bounding the approximation ratio
• Approximating the Metric TSP in Linear Time
• Approximating the metric TSP in linear time
• The travelling salesman and the PQ-tree

Cited in

(7)

• T*: a weighted double-heuristic search algorithm to find the shortest path
• Priority functions for the approximation of the metric TSP
• Min-weight double-tree shortcutting for metric TSP: bounding the approximation ratio
• Approximating the Metric TSP in Linear Time
• Fast minimum-weight double-tree shortcutting for metric TSP, Is the best one good enough?
• Computing compatible tours for the symmetric traveling salesman problem
• Approximating the metric TSP in linear time

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP

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