The following pages link to (Q4377051):
Displaying 10 items.
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- Metaheuristics for the tabu clustered traveling salesman problem (Q1652436) (← links)
- Container supply with multi-trailer trucks: parking strategies to speed up the gantry crane-based loading of freight trains in rail yards (Q1656422) (← links)
- When road trains supply freight trains: scheduling the container loading process by gantry crane between multi-trailer trucks and freight trains (Q2362240) (← links)
- Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
- Approximation Algorithms for Not Necessarily Disjoint Clustered TSP (Q4554892) (← links)
- Picker Routing in AGV-Assisted Order Picking Systems (Q5084661) (← links)
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← 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)
