Lifted and local reachability cuts for the vehicle routing problem with time windows
From MaRDI portal
Publication:336427
DOI10.1016/j.cor.2013.03.008zbMath1348.90063OpenAlexW2088310799MaRDI QIDQ336427
Maurizio Boccia, Pasquale Avella, Igor' Leonidovich Vasilyev
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.03.008
Applications of graph theory (05C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items
Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm, A branch and cut heuristic for a runway scheduling problem, A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries, A framework for solving routing problems for small and medium size companies, Strong cuts from compatibility relations for the dial-a-ride problem
Uses Software
Cites Work
- A general heuristic for vehicle routing problems
- Optimizing over the first Chvátal closure
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- On the capacitated vehicle routing problem
- Reachability cuts for the vehicle routing problem with time windows
- Vehicle routing problem with elementary shortest path based column generation
- Lagrangian duality applied to the vehicle routing problem with time windows
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- 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 Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Path inequalities for the vehicle routing problem with time windows
- Shortest Path Problems with Resource Constraints
