The Travelling Salesman and the PQ-Tree

DOI10.1287/moor.23.3.613zbMath1074.90560OpenAlexW2050701304MaRDI QIDQ2757553

Vladimir G. Deǐneko, Rainer E. Burkard, Gerhard J. Woeginger

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.23.3.613

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25)

Related Items (14)

Approximating the Metric TSP in Linear Time ⋮ Good triangulations yield good tours ⋮ A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem ⋮ On computing optimal linear diagrams ⋮ Upper bounds on ATSP neighborhood size. ⋮ Constraint-based very large-scale neighborhood search ⋮ Approximating the metric TSP in linear time ⋮ A survey of very large-scale neighborhood search techniques ⋮ Computing compatible tours for the symmetric traveling salesman problem ⋮ TSP tour domination and Hamilton cycle decompositions of regular digraphs ⋮ Further extension of the TSP assign neighborhood ⋮ Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio ⋮ Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number ⋮ Domination analysis of some heuristics for the traveling salesman problem

This page was built for publication: The Travelling Salesman and the PQ-Tree