Pages that link to "Item:Q3057116"
From MaRDI portal
The following pages link to A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem (Q3057116):
Displayed 9 items.
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- Improved lower bounds for the split delivery vehicle routing problem (Q991469) (← links)
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856) (← links)
- The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments (Q2811328) (← links)