PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Halman, Nir"

Author of the publication

copydeleteadd this publication to your clipboard
A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand.

, , , , and . Math. Oper. Res., 34 (3): 674-685 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Siddharth Nirupama Sriram University of Stuttgart

 

Other publications of authors with the same name

A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane.. Inf. Process. Lett., 86 (3): 121-128 (2003)The TV advertisements scheduling problem., , and . Optimization Letters, 13 (1): 81-94 (2019)Approximating convex functions via non-convex oracles under the relative noise model.. Discrete Optimization, (2015)On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model.. SIAM J. Comput., 38 (1): 1-45 (2008)Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier., and . SIAM J. Discret. Math., 35 (4): 2679-2722 (2021)A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand., , , , and . Math. Oper. Res., 34 (3): 674-685 (2009)A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy.. APPROX-RANDOM, volume 60 of LIPIcs, page 9:1-9:11. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Fully polynomial time approximation schemes for stochastic dynamic programs., , , , and . SODA, page 700-709. SIAM, (2008)Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle., , and . Operations Research, 60 (2): 429-446 (2012)Bi-criteria path problem with minimum length and maximum survival probability., , , , and . OR Spectrum, 41 (2): 469-489 (2019)