Pages that link to "Item:Q4835444"
From MaRDI portal
The following pages link to A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems (Q4835444):
Displayed 7 items.
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots (Q2427108) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)