Pages that link to "Item:Q1253617"
From MaRDI portal
The following pages link to Procedures for travelling salesman problems with additional constraints (Q1253617):
Displaying 16 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)
- The symmetric clustered traveling salesman problem (Q759661) (← links)
- Self-organizing feature maps for the vehicle routing problem with backhauls (Q880535) (← links)
- An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656) (← links)
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365) (← links)
- Metaheuristics for the tabu clustered traveling salesman problem (Q1652436) (← links)
- The traveling salesman problem with backhauls (Q1915968) (← links)
- Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
- A Heuristic Approach for Cluster TSP (Q3297279) (← links)
- Approximation Algorithms for Not Necessarily Disjoint Clustered TSP (Q4554892) (← links)
- Dynamic programming in the routing problem: decomposition variant (Q5097703) (← links)
- On the question of the optimization of permutations in the problem with dynamic constraints (Q5114333) (← links)
- Cluster-level operations planning for the out-of-position robotic arc-welding (Q5478828) (← links)
- An adaptive memory matheuristic for the set orienteering problem (Q6112827) (← links)
- Achieving feasibility for clustered traveling salesman problems using PQ‐trees (Q6139372) (← links)
