Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem

DOI10.1287/ijoc.2017.0747zbMath1386.90015OpenAlexW2734889840MaRDI QIDQ4599322

Ricardo Fukasawa, Laurent Poirrier

Publication date: 29 December 2017

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2017.0747

zbMATH Keywords

integer programmingdynamic programmingcolumn generationcomputational methodsbranch and price

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (1)

Computation of the largest positive Lyapunov exponent using rounding mode and recursive least square algorithm

Cites Work

• Unnamed Item
• On the safety of Gomory cut generators
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• Multistars, partial multistars and the capacitated vehicle routing problem
• Local branching
• Safe bounds in linear and mixed-integer linear programming
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Maximum-weight stable sets and safe lower bounds for graph coloring
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• Local cuts for mixed-integer programming
• Exact solutions to linear programming problems
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• The Truck Dispatching Problem
• 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
• Numerically Safe Gomory Mixed-Integer Cuts
• An Exact Rational Mixed-Integer Programming Solver
• Integer Programming
• Improved Branch-Cut-and-Price for Capacitated Vehicle Routing

This page was built for publication: Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem