The travelling salesman and the PQ-tree.

DOI10.1287/MOOR.23.3.613MaRDI QIDQ2757553zbMATH OpenOpenAlexFDO

Authors Rainer E. Burkard, Vladimir G. Deineko, 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

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

Recommendations

• The travelling salesman and the PQ-tree
• scientific article; zbMATH DE number 1131767
• Data Structures for Traveling Salesmen
• scientific article; zbMATH DE number 4053381
• scientific article; zbMATH DE number 437539

Cited in

(15)

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

This page was built for publication: The travelling salesman and the PQ-tree.

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