( en | de | ru )

 

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.

Nir Kahn

Nir Oren

Nir Yogev

Nir Levy

Alois Nirschl

 

Other publications of authors with the same name

The TV advertisements scheduling problem., , and . Optim. Lett., 13 (1): 81-94 (2019)A faster FPTAS for counting two-rowed contingency tables., and . Discret. Appl. Math., (2021)Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier., and . SIAM J. Discret. Math., 35 (4): 2679-2722 (2021)Fully polynomial time approximation schemes for stochastic dynamic programs., , , , and . SODA, page 700-709. SIAM, (2008)Bi-criteria path problem with minimum length and maximum survival probability., , , , and . OR Spectrum, 41 (2): 469-489 (2019)Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games are all LP-Type Problems.. Equilibrium Computation, volume 07471 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs.. INFORMS J. Comput., 32 (4): 1157-1181 (2020)Discrete and Lexicographic Helly-Type Theorems.. Discret. Comput. Geom., 39 (4): 690-719 (2008)Packing squares independently., , , , and . Theor. Comput. Sci., (2025)Knapsack problems with position-dependent item weights or profits., , and . Ann. Oper. Res., 326 (1): 137-156 (July 2023)