Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle
From MaRDI portal
Publication:2917636
DOI10.1287/opre.1110.1031zbMath1248.90007OpenAlexW2150462602WikidataQ59592297 ScholiaQ59592297MaRDI QIDQ2917636
Nir Halman, James B. Orlin, David Simchi-Levi
Publication date: 1 October 2012
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/77227
Related Items (12)
Asymptotic Optimality of Constant-Order Policies for Lost Sales Inventory Models with Large Lead Times ⋮ Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints ⋮ On the complexity of energy storage problems ⋮ Optimality Gap of Constant-Order Policies Decays Exponentially in the Lead Time for Lost Sales Models ⋮ An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand ⋮ The TV advertisements scheduling problem ⋮ Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs ⋮ A faster FPTAS for counting two-rowed contingency tables ⋮ Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs ⋮ Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier ⋮ Newsvendor problems: an integrated method for estimation and optimisation
This page was built for publication: Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle
