Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
From MaRDI portal
Publication:6160235
DOI10.3138/infor.48.1.053MaRDI QIDQ6160235
Guy Desaulniers, Simon Spoorendonk
Publication date: 9 May 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Related Items (5)
A scheme for determining vehicle routes based on Arc-based service network design ⋮ Consistency Cuts for Dantzig-Wolfe Reformulations ⋮ Limited memory rank-1 cuts for vehicle routing problems ⋮ Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange ⋮ A branch-and-cut algorithm for the capacitated profitable tour problem
Cites Work
- Unnamed Item
- Unnamed Item
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- On the membership problem for the elementary closure of a polyhedron
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- 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
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- 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
- Decomposition Principle for 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
- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- 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
- On the facial structure of set packing polyhedra
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
- Vehicle Routing Problem with Time Windows
This page was built for publication: Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows