Approximate dynamic programming for lateral transshipment problems in multi-location inventory systems
type: Item
instance of: scholarly article
title: Approximate dynamic programming for lateral transshipment problems in multi-location inventory systems
zbMATH Open document ID: 1374.90021
author: Joern Meissner
author: Olga V. Senicheva
published in: European Journal of Operational Research
publication date: 2017-11-23T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6811918
zbMATH Keywords: dynamic programming
zbMATH Keywords: multi-location inventory
zbMATH Keywords: proactive transshipments
zbMATH Keywords: lost sales
zbMATH Keywords: concave piecewise-linear approximation
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.06.049
OpenAlex ID: W2488808246
cites work: Optimal Joint Replenishment and Transshipment Policies in a Multi-Period Inventory System with Lost Sales
cites work: Dynamic balancing of inventory in supply chains
cites work: A Note on Shadow Prices in Linear Programming
cites work: Modelling replenishment and transshipment decisions in periodic review multilocation inventory systems
cites work: An index heuristic for transshipment decisions in multi-location inventory systems based on a pairwise decomposition
cites work: The use of simple calibrations of individual locations in making transshipment decisions in a multi-location inventory network
cites work: An Optimal Policy for a Two Depot Inventory Problem with Stock Transfer
cites work: The Computation of Shadow Prices in Linear Programming
cites work: A New Decision Rule for Lateral Transshipments in Inventory Systems
cites work: Q3649086
cites work: Q3241581
cites work: Stock redistribution in two-echelon logistics systems
cites work: Dynamic programming and optimal control. Vol. 2
cites work: Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming
cites work: An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution
cites work: An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
cites work: An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times
cites work: Sharing and Lateral Transshipment of Inventory in a Supply Chain with Expensive Low-Demand Items
cites work: Q5512690
cites work: The Multiperiod Multilocation Inventory Problem
cites work: An improved heuristic for deciding on emergency transshipments.
cites work: Enhanced lateral transshipments in a multi-location inventory system
cites work: A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy
cites work: Approximate Dynamic Programming
cites work: Optimal and Approximate Policies in Multiperiod, Multilocation Inventory Models with Transshipments
cites work: A semi-Markov decision problem for proactive and reactive transshipments between multiple warehouses
cites work: Transshipment and rebalancing policies for library books
cites work: Multi-item spare parts systems with lateral transshipments and waiting time constraints
cites work: On the Structure of Lost-Sales Inventory Models
DOI: 10.1016/J.EJOR.2017.06.049
description: scientific article; zbMATH DE number 6811918