Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing
DOI10.1287/IJOC.2014.0601zbMATH Open1304.90020OpenAlexW2148949482MaRDI QIDQ2940071FDOQ2940071
Authors: Dimitri J. Papageorgiou, G. L. Nemhauser, Ahmet Keha, Joel Sokol 
Publication date: 26 January 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b47ec8a482bedd6ddaebf719ad5380210458c3da
Recommendations
- A multi-product maritime inventory routing problem with undedicated compartments
- A branch-price-and-cut algorithm for single-product maritime inventory routing
- A matheuristic for the multi-product maritime inventory routing problem
- A maritime inventory routing problem: practical approach
- An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem
- A relax-and-fix algorithm for a maritime inventory routing problem
- A maritime inventory routing problem with stochastic sailing and port times
- An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem
- Maritime inventory routing problem with multiple time windows
- Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
aggregationdecompositionlot sizingmaritime transportationmixed-integer linear programmingdeterministic inventory routing
Cites Work
- MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
- Production Planning by Mixed Integer Programming
- Industrial aspects and literature survey: Combined inventory management and routing
- Title not available (Why is that?)
- Cascading knapsack inequalities: reformulation of a crude oil distribution problem
- Constraint programming for LNG ship scheduling and inventory management
- A maritime inventory routing problem: discrete time formulations and valid inequalities
- A branch-price-and-cut algorithm for single-product maritime inventory routing
- A maritime inventory routing problem: practical approach
- Title not available (Why is that?)
- A branch-and-price guided search approach to maritime inventory routing
- Supply Chain Optimization for the Liquefied Natural Gas Business
- Shipment planning at oil refineries using column generation and valid inequalities
- Dynamic knapsack sets and capacitated lot-sizing
Cited In (14)
- MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
- A branch-price-and-cut algorithm for single-product maritime inventory routing
- Maritime location inventory routing problem for island supply chain network under periodic freight demand
- A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing
- Flexible solutions to maritime inventory routing problems with delivery time windows
- 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
- A maritime inventory routing problem: practical approach
- Using and extending fix-and-relax to solve maritime inventory routing problems
- A matheuristic for the multi-product maritime inventory routing problem
- A relax-and-fix algorithm for a maritime inventory routing problem
- Long‐term effects of short planning horizons for inventory routing problems
Uses Software
This page was built for publication: Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940071)
