Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
From MaRDI portal
Publication:5419012
DOI10.1007/978-3-319-07557-0_33zbMath1418.90239OpenAlexW321964111MaRDI QIDQ5419012
Diego Pecin, Marcus Poggi, Artur Alves Pessoa, Eduardo Uchoa
Publication date: 2 June 2014
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-07557-0_33
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items (14)
Efficient elementary and restricted non-elementary route pricing ⋮ Exact Algorithms for the Chance-Constrained Vehicle Routing Problem ⋮ Improved branch-cut-and-price for capacitated vehicle routing ⋮ Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ A generic exact solver for vehicle routing and related problems ⋮ New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows ⋮ Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem ⋮ A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem ⋮ New benchmark instances for the capacitated vehicle routing problem ⋮ Minimum makespan vehicle routing problem with compatibility constraints ⋮ Solving bin packing problems using VRPSolver models ⋮ Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange ⋮ Exact algorithms for the chance-constrained vehicle routing problem
Uses Software
This page was built for publication: Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
