Pages that link to "Item:Q697581"
From MaRDI portal
The following pages link to Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581):
Displayed 10 items.
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem (Q596294) (← links)
- Location-routing: issues, models and methods (Q856260) (← links)
- Genetic algorithms for supply-chain scheduling: a case study in the distribution of ready-mixed concrete (Q857351) (← links)
- An application of special ordered sets to a periodic milk collection problem (Q869614) (← links)
- A decision support system for a real vehicle routing problem. (Q1420384) (← links)
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099) (← links)
- Heuristics for the lexicographic Max-ordering vehicle routing problem (Q2461267) (← links)
- Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
- Minimizing the total cost in an integrated vendor-managed inventory system (Q2491326) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)