Pages that link to "Item:Q585095"
From MaRDI portal
The following pages link to A branch and bound algorithm for the capacitated vehicle routing problem (Q585095):
Displayed 12 items.
- The vehicle routing problem with demand range (Q867541) (← links)
- A mixed constrained (identical) vehicle routing problem for time minimisation (Q998682) (← links)
- A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- Vehicle routing with split deliveries (Q1327209) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- A compact model and tight bounds for a combined location-routing problem (Q1886846) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots (Q2427108) (← links)
- Solving an urban waste collection problem using ants heuristics (Q2475858) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- Projection results for vehicle routing (Q2583125) (← links)