Numerically safe lower bounds for the capacitated vehicle routing problem

DOI10.1287/IJOC.2017.0747MaRDI QIDQ4599322zbMATH OpenOpenAlexFDO

Authors 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

dynamic programminginteger programmingcolumn generationcomputational methodsbranch and price

Mathematics Subject Classification ID

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

Recommendations

• Safe bounds in linear and mixed-integer linear programming
• Improved branch-cut-and-price for capacitated vehicle routing
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Improved branch-cut-and-price for capacitated vehicle routing
• scientific article; zbMATH DE number 1234739

Cites work

• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• An exact rational mixed-integer programming solver
• Exact solutions to linear programming problems
• Improved branch-cut-and-price for capacitated vehicle routing
• Integer Programming
• Local branching
• Local cuts for mixed-integer programming
• Maximum-weight stable sets and safe lower bounds for graph coloring
• Multistars, partial multistars and the capacitated vehicle routing problem
• New route relaxation and pricing strategies for the vehicle routing problem
• Numerically safe Gomory mixed-integer cuts
• On the safety of Gomory cut generators
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Safe bounds in linear and mixed-integer linear programming
• The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
• The traveling salesman problem. A computational study.
• The truck dispatching problem

Cited in

(2)

• Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
• Computation of the largest positive Lyapunov exponent using rounding mode and recursive least square algorithm

This page was built for publication: Numerically safe lower bounds for the capacitated vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599322)