Pages that link to "Item:Q1198313"
From MaRDI portal
The following pages link to The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313):
Displayed 10 items.
- A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows (Q3422371) (← links)
- Order batching in walk-and-pick order picking systems (Q3533177) (← links)
- Production scheduling optimization algorithm for the hot rolling processes (Q3533181) (← links)
- Vehicle routing with stochastic demands and restricted failures (Q4201811) (← links)
- Algorithms for the Vehicle Routing Problems with Time Deadlines (Q4305486) (← links)
- A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions (Q4305488) (← links)
- On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds (Q5485097) (← links)
- Heuristics from Nature for Hard Combinatorial Optimization Problems (Q5690286) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- A tabu search method for the truck and trailer routing problem (Q5955470) (← links)