Computing near-optimal policies in generalized joint replenishment
From MaRDI portal
Publication:2815435
DOI10.1287/IJOC.1100.0433zbMATH Open1460.90007OpenAlexW2147783939MaRDI QIDQ2815435FDOQ2815435
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
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
- The Linear Programming Approach to Approximate Dynamic Programming
- Approximate Dynamic Programming
- Generalized polynomial approximations in Markovian decision processes
- A Price-Directed Approach to Stochastic Inventory/Routing
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- Title not available (Why is that?)
- 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
- An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
- Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions
- Duality and Existence of Optimal Policies in Generalized Joint Replenishment
- Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions”
- Routing propane deliveries
Cited In (12)
- Reductions of non-separable approximate linear programs for network revenue management
- Relationship between least squares Monte Carlo and approximate linear programming
- An analytical study of the \(Q(s,S)\) policy applied to the joint replenishment problem
- Duality and Existence of Optimal Policies in Generalized Joint Replenishment
- 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
- 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)
