Pages that link to "Item:Q2757553"
From MaRDI portal
The following pages link to The travelling salesman and the PQ-tree. (Q2757553):
Displaying 13 items.
- Constraint-based very large-scale neighborhood search (Q434452) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- Approximating the metric TSP in linear time (Q649110) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
- Domination analysis of some heuristics for the traveling salesman problem (Q1602706) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Further extension of the TSP assign neighborhood (Q2491321) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- Min-weight double-tree shortcutting for metric TSP: bounding the approximation ratio (Q2839206) (← links)
- Approximating the Metric TSP in Linear Time (Q5302042) (← links)
- TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)