Pages that link to "Item:Q1847167"
From MaRDI portal
The following pages link to On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167):
Displaying 3 items.
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← links)
- Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows (Q5240195) (← links)
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots (Q5488252) (← links)
