Integer linear programming formulation for a vehicle routing problem
From MaRDI portal
Recommendations
- A remark on ``Integer linear programming formulation for a vehicle routing problem by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations
- Variants and formulations of the vehicle routing problem
- Optimal Routing under Capacity and Distance Restrictions
- scientific article; zbMATH DE number 6913886
- Polyhedral results for a vehicle routing problem
Cites work
Cited in
(10)- A remark on ``Integer linear programming formulation for a vehicle routing problem by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations
- Optimal Routing under Capacity and Distance Restrictions
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Solving 0-1 programming problems by a penalty approach.
- Integer linear programming models for global routing
- A new subtour elimination constraint for the vehicle routing problem
- Routing problems: A bibliography
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
- A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
- Siting recycling drop-off stations in urban area by genetic algorithm-based fuzzy multiobjective nonlinear integer programming modeling
This page was built for publication: Integer linear programming formulation for a vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804473)