Flexible solutions to maritime inventory routing problems with delivery time windows
type: Item
instance of: scholarly article
title: Flexible solutions to maritime inventory routing problems with delivery time windows
zbMATH Open document ID: 1391.90106
author: Chengliang Zhang
author: G. L. Nemhauser
author: Joel Sokol
author: Myun Seok Cheon
author: Ahmet Keha
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901506
zbMATH Keywords: inventory routing
zbMATH Keywords: uncertainty
zbMATH Keywords: simulation
zbMATH Keywords: Lagrangian heuristic
describes a project that uses: MIRPLib
MaRDI profile type: Publication
full work available at URL: j.cor.2017.08.011
OpenAlex ID: W2753198170
cites work: A maritime inventory routing problem: discrete time formulations and valid inequalities
cites work: A maritime inventory routing problem with stochastic sailing and port times
cites work: Layered Formulation for the Robust Vehicle Routing Problem with Time Windows
cites work: The robust vehicle routing problem with time windows
cites work: Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
cites work: Robust Fleet Sizing and Deployment for Industrial and Independent Bulk Ocean Shipping Companies
cites work: Q3182207
cites work: Robust ship scheduling with multiple time windows
cites work: Q3523238
cites work: Light Robustness
cites work: Validation of subgradient optimization
cites work: Modeling with Stochastic Programming
cites work: The sample average approximation method for stochastic discrete optimization
cites work: Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing
cites work: Shipment planning at oil refineries using column generation and valid inequalities
cites work: Cascading knapsack inequalities: reformulation of a crude oil distribution problem
cites work: Rates of Convergence in Stochastic Programs with Complete Integer Recourse
cites work: Lectures on Stochastic Programming
cites work: A maritime inventory routing problem: practical approach
cites work: Heuristics for dynamic and stochastic routing in industrial shipping
cites work: The sample average approximation method applied to stochastic routing problems: a computational study
DOI: 10.1016/J.COR.2017.08.011
description: scientific article; zbMATH DE number 6901506