Chvàtal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
From MaRDI portal
(Redirected from Publication:3564367)
Recommendations
- 2-path cuts for the vehicle routing problem with time windows
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Lifted and local reachability cuts for the vehicle routing problem with time windows
- Limited memory rank-1 cuts for vehicle routing problems
- Reachability cuts for the vehicle routing problem with time windows
Cites work
- scientific article; zbMATH DE number 1749220 (Why is no real title available?)
- scientific article; zbMATH DE number 1452994 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- 2-path cuts for the vehicle routing problem with time windows
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A polyhedral approach to edge coloring
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
- Edmonds polytopes and a hierarchy of combinatorial problems
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- On Cutting Planes
- On the membership problem for the elementary closure of a polyhedron
- On the separation of maximally violated mod-\(k\) cuts
- Optimizing over the First Chvàtal Closure
- Outline of an algorithm for integer solutions to linear programs
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Shortest Path Problems with Resource Constraints
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- The shortest-path problem with resource constraints and k-cycle elimination for k 3
- Vehicle routing problem with elementary shortest path based column generation
Cited in
(13)- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Reachability cuts for the vehicle routing problem with time windows
- An enhanced exact algorithm for the multi-trip vehicle routing problem with time windows and capacitated unloading station
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Consistency cuts for Dantzig-Wolfe reformulations
- A generic exact solver for vehicle routing and related problems
- New enhancements for the exact solution of the vehicle routing problem with time windows
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- Limited memory rank-1 cuts for vehicle routing problems
- A branch-and-cut algorithm for the capacitated profitable tour problem
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
- Lifted and local reachability cuts for the vehicle routing problem with time windows
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
This page was built for publication: Chvàtal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564367)
