Computing Near-Optimal Policies in Generalized Joint Replenishment

DOI10.1287/ijoc.1100.0433zbMath1460.90007OpenAlexW2147783939MaRDI QIDQ2815435

Daniel Adelman, Diego Klabjan

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/466421231875dc9b8dff1d37c8b65e8adfe799ff

zbMATH Keywords

approximate dynamic programminggeneralized joint replenishmentpiecewise-linear ridge functions

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (7)

Heuristics for dynamic and stochastic inventory-routing ⋮ Reductions of non-separable approximate linear programs for network revenue management ⋮ Relationship between least squares Monte Carlo and approximate linear programming ⋮ Identifying proactive ICU patient admission, transfer and diversion policies in a public-private hospital network ⋮ A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes ⋮ Dynamic multi-appointment patient scheduling for radiation therapy ⋮ On packing and covering polyhedra in infinite dimensions

Cites Work

• Unnamed Item
• Unnamed Item
• Generalized polynomial approximations in Markovian decision processes
• A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
• Existence of Optimal Policies for Semi-Markov Decision Processes Using Duality for Infinite Linear Programming
• The Linear Programming Approach to Approximate Dynamic Programming
• Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions
• Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions”
• Approximate Dynamic Programming
• A Price-Directed Approach to Stochastic Inventory/Routing
• An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
• Duality and Existence of Optimal Policies in Generalized Joint Replenishment

This page was built for publication: Computing Near-Optimal Policies in Generalized Joint Replenishment