Preprocessing to reduce vehicle capacity for routing problems
From MaRDI portal
Recommendations
- Exact algorithms for routing problems under vehicle capacity constraints
- On the capacitated vehicle routing problem
- scientific article; zbMATH DE number 4070618
- Bounds and Heuristics for Capacitated Routing Problems
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
Cites work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 3989085 (Why is no real title available?)
- Improved branch-cut-and-price for capacitated vehicle routing
- New benchmark instances for the capacitated vehicle routing problem
- New route relaxation and pricing strategies for the vehicle routing problem
- On the complexity of the separation problem for rounded capacity inequalities
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Probabilistic diversification and intensification in local search for vehicle routing
- Reducibility among combinatorial problems
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning
- Vehicle Routing
This page was built for publication: Preprocessing to reduce vehicle capacity for routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097441)