Pages that link to "Item:Q1306365"
From MaRDI portal
The following pages link to A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365):
Displaying 11 items.
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- An exact algorithm for the clustered travelling salesman problem (Q505157) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
- Traveling salesman path problems (Q2476987) (← links)
- Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6039533) (← links)
- Achieving feasibility for clustered traveling salesman problems using PQ‐trees (Q6139372) (← links)
- New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule (Q6176400) (← links)
