The following pages link to (Q4221472):
Displaying 8 items.
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs (Q2494811) (← links)
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)
- On the vehicle routing problem (Q4378935) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
