Path inequalities for the vehicle routing problem with time windows
From MaRDI portal
Publication:5295485
DOI10.1002/net.20178zbMath1141.90338MaRDI QIDQ5295485
Natashia Boland, Brian Kallehauge, Oli B. G. Madsen
Publication date: 30 July 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20178
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B06: Transportation, logistics and supply chain management
Related Items
Two exact algorithms for the traveling umpire problem, Lifted and local reachability cuts for the vehicle routing problem with time windows, Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm, Robust vehicle routing under uncertainty via branch-price-and-cut, New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP, Formulations and exact algorithms for the vehicle routing problem with time windows, Exact solutions to the double travelling salesman problem with multiple stacks, Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
Uses Software
Cites Work