The following pages link to (Q3688098):
Displayed 20 items.
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- Integer linear programming formulation for a vehicle routing problem (Q804473) (← links)
- Models and exact solutions for a class of stochastic location-routing problems (Q1123112) (← links)
- A result on projection for the vehicle routing problem (Q1127162) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- A new subtour elimination constraint for the vehicle routing problem (Q1278251) (← links)
- Vehicle routing with split deliveries (Q1327209) (← links)
- A heuristic solution to the warehouse location-routing problem (Q1331555) (← links)
- A robust strategy approach to a strategic mobility problem (Q1342065) (← links)
- Expected part delays as a secondary layout criterion in automated manufacturing systems (Q1374180) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- Solving a fuel delivery problem by heuristic and exact approaches. (Q1410332) (← links)
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099) (← links)
- Separating capacity constraints in the CVRP using tabu search (Q1609917) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- Linear time approximation schemes for vehicle scheduling problems (Q1887080) (← links)
- A new heuristic for the fleet size and mix vehicle routing problem (Q2276859) (← links)
- On the vehicle routing problem (Q4378935) (← links)