A branch-and-price guided search approach to maritime inventory routing
From MaRDI portal
Publication:502460
DOI10.1016/j.cor.2012.09.010zbMath1352.90059OpenAlexW2081325117MaRDI QIDQ502460
Jin-Hwa Song, Mike Hewitt, Nemhauser, George I., Savelsbergh, Martin W. P.
Publication date: 5 January 2017
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.09.010
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Inventory, storage, reservoirs (90B05) Case-oriented studies in operations research (90B90)
Related Items (11)
The two-echelon multi-depot inventory-routing problem ⋮ A comprehensive annual delivery program for upstream liquefied natural gas supply chain ⋮ An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem ⋮ Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing ⋮ A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem ⋮ An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem ⋮ Combined ship routing and inventory management in the salmon farming industry ⋮ A matheuristic for the multi-product maritime inventory routing problem ⋮ MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results ⋮ Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing ⋮ Optimal inventory level control and replenishment plan for retailers
This page was built for publication: A branch-and-price guided search approach to maritime inventory routing