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):
Displaying 3 items.
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- An integer optimality condition for column generation on zero-one linear programs (Q2419361) (← links)
