Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
From MaRDI portal
Publication:4642458
DOI10.1002/net.21586zbMath1390.90011OpenAlexW2108728527MaRDI QIDQ4642458
Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey
Publication date: 23 May 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://uclouvain.be/cps/ucl/doc/core/documents/coredp2013_45web.pdf
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items
Heuristics for dynamic and stochastic inventory-routing, Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment, Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm, Comparison of formulations for the inventory routing problem, Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem, An exact solution approach for the inventory routing problem with time windows, An improved formulation for the inventory routing problem with time-varying demands, A branch-and-cut embedded matheuristic for the inventory routing problem, Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery, On the zero-inventory-ordering policy in the inventory routing problem, Integrated inventory routing and freight consolidation for perishable goods, Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation, A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries, A branch-and-cut algorithm for an assembly routing problem, An exact approach for cyclic inbound inventory routing in a level production system, Formulations for an inventory routing problem, Analysis of effective sets of routes for the split-delivery periodic inventory routing problem
