Pages that link to "Item:Q1339118"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for vehicle routing problems (Q1339118):
Displayed 8 items.
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- A global MILP model for FMS scheduling (Q1278123) (← links)
- Separating capacity constraints in the CVRP using tabu search (Q1609917) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- An efficient transformation of the generalized vehicle routing problem (Q1971986) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)