The following pages link to (Q4247262):
Displaying 3 items.
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365) (← links)
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139) (← links)
- New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule (Q6176400) (← links)