Pages that link to "Item:Q505157"
From MaRDI portal
The following pages link to An exact algorithm for the clustered travelling salesman problem (Q505157):
Displaying 10 items.
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- Traveling salesman problem with clustering (Q616229) (← links)
- The symmetric clustered traveling salesman problem (Q759661) (← links)
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case (Q1096550) (← links)
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139) (← links)
- Metaheuristics for the tabu clustered traveling salesman problem (Q1652436) (← links)
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) (← links)
- A Heuristic Approach for Cluster TSP (Q3297279) (← links)
- Some applications of the clustered travelling salesman problem (Q4656710) (← links)
- Heuristics for a cash-collection routing problem with a cluster-first route-second approach (Q6099456) (← links)