An approximate dynamic-programming approach to the joint replenishment problem

DOI10.1287/MOOR.2013.0611MaRDI QIDQ5169708zbMATH OpenOpenAlexFDO

Authors Danny Segev

Publication date 11 July 2014

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.2013.0611

zbMATH Keywords

approximation algorithmsdynamic programmingjoint replenishment problem

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Computing near-optimal policies in generalized joint replenishment
• Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions
• Approximation algorithms and hardness results for the joint replenishment problem with constant demands
• An efficient polynomial-time approximation scheme for the joint replenishment problem
• The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions

Cited in

(17)

• The dynamic-demand joint replenishment problem with approximated transportation costs
• Calculating can-order policies for the joint replenishment problem by the compensation approach
• A global optimum search algorithm for the joint replenishment problem under power-of-two policy.
• An efficient optimal solution method for the joint replenishment problem with minimum order quantities
• Computing near-optimal policies in generalized joint replenishment
• Dynamic programming approximation algorithms for the capacitated lot-sizing problem
• The submodular joint replenishment problem
• Approximate dynamic programming methods for an inventory allocation problem under uncertainty
• Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions”
• The Joint Replenishment Problem with General Joint Cost Structures
• A new method for joint replenishment problems
• An Optimal Method for a Deterministic Joint Replenishment Inventory Policy in Discrete Time
• An efficient polynomial-time approximation scheme for the joint replenishment problem
• The periodic joint replenishment problem is strongly \(\mathcal{NP} \)-hard
• Better Approximation Bounds for the Joint Replenishment Problem
• Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings
• An analytical study of the \(Q(s,S)\) policy applied to the joint replenishment problem

This page was built for publication: An approximate dynamic-programming approach to the joint replenishment problem

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