Reachability cuts for the vehicle routing problem with time windows
From MaRDI portal
Publication:2432846
DOI10.1016/J.EJOR.2005.04.022zbMATH Open1137.90587OpenAlexW2150176315MaRDI QIDQ2432846FDOQ2432846
Authors: Jens Lysgaard 
Publication date: 25 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.04.022
Recommendations
- Lifted and local reachability cuts for the vehicle routing problem with time windows
- 2-path cuts for the vehicle routing problem with time windows
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- Chvàtal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
- Path inequalities for the vehicle routing problem with time windows
Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Cites Work
- Network flows. Theory, algorithms, and applications.
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Computational investigations of maximum flow algorithms
- 2-path cuts for the vehicle routing problem with time windows
- An exact algorithm for the maximum clique problem
- Projection results for vehicle routing
- The precedence-constrained asymmetric traveling salesman polytope
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
Cited In (16)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- The dial-a-ride problem with private fleet and common carrier
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Pricing routines for vehicle routing with time windows on road networks
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm
- The vehicle routing problem with release dates and flexible time windows
- A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
- Lifted and local reachability cuts for the vehicle routing problem with time windows
- A 2-stage method for a field service routing problem with stochastic travel and service times
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
- Strong cuts from compatibility relations for the dial-a-ride problem
- Recent models and algorithms for one-to-one pickup and delivery problems
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- Chvàtal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
- 2-path cuts for the vehicle routing problem with time windows
Uses Software
This page was built for publication: Reachability cuts for 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 Q2432846)
