Pages that link to "Item:Q759661"
From MaRDI portal
The following pages link to The symmetric clustered traveling salesman problem (Q759661):
Displayed 14 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)
- Self-organizing feature maps for the vehicle routing problem with backhauls (Q880535) (← links)
- An efficient composite heuristic for the symmetric generalized traveling salesman problem (Q1296792) (← links)
- Metaheuristics for the tabu clustered traveling salesman problem (Q1652436) (← links)
- The traveling salesman problem with backhauls (Q1915968) (← links)
- The clustered team orienteering problem (Q2273693) (← links)
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
- An exact method for the double TSP with multiple stacks (Q3002549) (← links)
- Picker Routing in AGV-Assisted Order Picking Systems (Q5084661) (← links)
- Cluster-level operations planning for the out-of-position robotic arc-welding (Q5478828) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6039533) (← links)
- An adaptive memory matheuristic for the set orienteering problem (Q6112827) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6167001) (← links)