Chvàtal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
DOI10.1007/978-0-387-77778-8_18zbMATH Open1187.90059OpenAlexW34509131WikidataQ58826419 ScholiaQ58826419MaRDI QIDQ3564367FDOQ3564367
B. Petersen, David Pisinger, Simon Spoorendonk
Publication date: 2 June 2010
Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_18
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cites Work
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Title not available (Why is that?)
- The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Shortest Path Problems with Resource Constraints
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Outline of an algorithm for integer solutions to linear programs
- Title not available (Why is that?)
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Title not available (Why is that?)
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Vehicle routing problem with elementary shortest path based column generation
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- 2-path cuts for the vehicle routing problem with time windows
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Edmonds polytopes and a hierarchy of combinatorial problems
- Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
- On the membership problem for the elementary closure of a polyhedron
- On Cutting Planes
- On the separation of maximally violated mod-\(k\) cuts
- A polyhedral approach to edge coloring
- Optimizing over the First Chvàtal Closure
Cited In (10)
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- A generic exact solver for vehicle routing and related problems
- 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
- Consistency Cuts for Dantzig-Wolfe Reformulations
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
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 👍 👎
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)
