Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows
From MaRDI portal
Publication:3564367
DOI10.1007/978-0-387-77778-8_18zbMath1187.90059OpenAlexW34509131WikidataQ58826419 ScholiaQ58826419MaRDI QIDQ3564367
Björn 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)
Related Items (10)
Consistency Cuts for Dantzig-Wolfe Reformulations ⋮ Lifted and local reachability cuts for the vehicle routing problem with time windows ⋮ Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems ⋮ Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems ⋮ Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework ⋮ A generic exact solver for vehicle routing and related problems ⋮ 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 ⋮ Limited memory rank-1 cuts for vehicle routing problems ⋮ A branch-and-cut algorithm for the capacitated profitable tour problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the membership problem for the elementary closure of a polyhedron
- A polyhedral approach to edge coloring
- On the separation of maximally violated mod-\(k\) cuts
- 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
- Edmonds polytopes and a hierarchy of combinatorial problems
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Outline of an algorithm for integer solutions to linear programs
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Optimizing over the First Chvàtal Closure
- On Cutting Planes
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Shortest Path Problems with Resource Constraints
- Branch-and-Price Heuristics: A Case Study on 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
