Similar Search Results

Approximating the nonlinear newsvendor and single-item stochastic lot-sizing problems when data is given by an oracle

Halman, Nir; Orlin, James B.; Simchi-Levi, David - In: Operations research 60 (2012) 2, pp. 429-446

Persistent link: https://www.econbiz.de/10009554763

Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks

Halman, Nir; Li, Chung-lun; Simchi-Levi, David - In: Operations research letters 37 (2009) 4, pp. 239-244

Persistent link: https://www.econbiz.de/10003908210

A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand

Halman, Nir; Klabjan, Diego; Mostagir, Mohamed; Orlin, Jim - In: Mathematics of operations research 34 (2009) 3, pp. 674-685

Persistent link: https://www.econbiz.de/10003892632

Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle

Halman, Nir; Orlin, James B.; Simchi-Levi, David - In: Operations research : the journal of the Operations … 60 (2012) 2, pp. 429-447

Persistent link: https://www.econbiz.de/10009973777

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

Halman, Nir; Klabjan, Diego; Mostagir, Mohamed; Orlin, Jim - In: Mathematics of operations research 34 (2009) 3, pp. 674-685

Persistent link: https://www.econbiz.de/10008304787

Fully polynomial-time approximation schemes for time–cost tradeoff problems in series–parallel project networks

Halman, Nir; Li, Chung-Lun; Simchi-Levi, David - In: Operations research letters 37 (2009) 4, pp. 239-244

Persistent link: https://www.econbiz.de/10008270181

A Fully Polynomial Time Approximation Scheme for Single-Item Stochastic Lot-Sizing Problems with Discrete Demand

Orlin, James B. - 2006

The single-item stochastic lot-sizing problem is to find an inventory replenishment policy in the presence of a stochastic demand under periodic review and finite time horizon. The computational intractability of computing an optimal policy is widely believed and therefore approximation...

Persistent link: https://www.econbiz.de/10012734449

Fully polynomial-time approximation schemes for time–cost tradeoff problems in series–parallel project networks

Halman, Nir; Li, Chung-Lun; Simchi-Levi, David - In: Operations research letters 37 (2009) 4, pp. 239-245

Persistent link: https://www.econbiz.de/10008898697