Computing near-optimal policies in generalized joint replenishment

DOI10.1287/IJOC.1100.0433MaRDI QIDQ2815435zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An approximate dynamic-programming approach to the joint replenishment problem
• Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions
• The joint replenishment problem: optimal policy and exact evaluation method
• A New Optimal Algorithm for the Joint Replenishment Problem
• A new method for joint replenishment problems

Cites work

• scientific article; zbMATH DE number 837313 (Why is no real title available?)
• A Price-Directed Approach to Stochastic Inventory/Routing
• A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
• An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
• Approximate Dynamic Programming
• Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions”
• Duality and Existence of Optimal Policies in Generalized Joint Replenishment
• Existence of Optimal Policies for Semi-Markov Decision Processes Using Duality for Infinite Linear Programming
• Generalized polynomial approximations in Markovian decision processes
• Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
• Routing propane deliveries
• The Linear Programming Approach to Approximate Dynamic Programming

Cited in

(12)

• Relationship between least squares Monte Carlo and approximate linear programming
• Reductions of non-separable approximate linear programs for network revenue management
• An analytical study of the \(Q(s,S)\) policy applied to the joint replenishment problem
• Identifying proactive ICU patient admission, transfer and diversion policies in a public-private hospital network
• Duality and Existence of Optimal Policies in Generalized Joint Replenishment
• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
• On packing and covering polyhedra in infinite dimensions
• Heuristics for dynamic and stochastic inventory-routing
• An approximate dynamic-programming approach to the joint replenishment problem
• Computing optimal ( s, S ) policies for inventory systems with a cut-off transaction size and the option of joint replenishment
• Dynamic multi-appointment patient scheduling for radiation therapy
• A global optimum search algorithm for the joint replenishment problem under power-of-two policy.

This page was built for publication: Computing near-optimal policies in generalized joint replenishment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815435)