The travelling salesman and the PQ-tree.
From MaRDI portal
Publication:2757553
Recommendations
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)