Pages that link to "Item:Q948965"
From MaRDI portal
The following pages link to An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965):
Displayed 13 items.
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
- Modelling transfer line design problem via a set partitioning problem (Q1758032) (← links)
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
- The close-open mixed vehicle routing problem (Q1926744) (← links)
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856) (← links)
- A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← links)
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)