Column elimination for capacitated vehicle routing problems
From MaRDI portal
Recommendations
- Cumulative vehicle routing problem: a column generation approach
- Vehicle routing problem with elementary shortest path based column generation
- On the capacitated vehicle routing problem
- Vehicle routing via column generation
- A column generation approach for a multi-attribute vehicle routing problem
- Performances improvement of the column generation algorithm: application to vehicle routing problems
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Column generation for vehicle routing problems with multiple synchronization constraints
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
Cites work
- A fast algorithm for the maximum clique problem
- A generic exact solver for vehicle routing and related problems
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Branch-and-price: Column generation for solving huge integer programs
- Decision diagrams for optimization
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Graph coloring lower bounds from decision diagrams
- Graph coloring with decision diagrams
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- Improved branch-cut-and-price for capacitated vehicle routing
- Integer Programming
- Network flows. Theory, algorithms, and applications.
- New benchmark instances for the capacitated vehicle routing problem
- New route relaxation and pricing strategies for the vehicle routing problem
- Path-reduced costs for eliminating arcs in routing and scheduling
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Shortest Path Problems with Resource Constraints
- Two ``well-known properties of subgradient optimization
- Variable ordering for decision diagrams: a portfolio approach
- Vehicle Routing
Cited in
(1)
This page was built for publication: Column elimination for capacitated vehicle routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057244)
