Pages that link to "Item:Q4554892"
From MaRDI portal
The following pages link to Approximation Algorithms for Not Necessarily Disjoint Clustered TSP (Q4554892):
Displaying 7 items.
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139) (← links)
- A note on approximation algorithms of the clustered traveling salesman problem (Q2398506) (← links)
- Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
- Local search for <i>Hamiltonian Path</i> with applications to clustering visitation paths (Q4661201) (← links)
- Recent Advances in Constraints (Q5901712) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6039533) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6167001) (← links)