( en | de | ru )

 

Disambiguation of "Halman, Nir"

Author of the publication

copydeleteadd this publication to your clipboard
Fully polynomial time approximation schemes for stochastic dynamic programs.

, , , , and . SODA, page 700-709. SIAM, (2008)

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 Levy

Nir Yogev

Udo Nirenberg

 

Other publications of authors with the same name

A faster FPTAS for counting two-rowed contingency tables., and . Discret. Appl. Math., (2021)The TV advertisements scheduling problem., , and . Optim. Lett., 13 (1): 81-94 (2019)A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane.. Inf. Process. Lett., 86 (3): 121-128 (2003)Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints., , and . Eur. J. Oper. Res., 270 (2): 435-447 (2018)Approximating convex functions via non-convex oracles under the relative noise model.. Discret. Optim., (2015)Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier., and . SIAM J. Discret. Math., 35 (4): 2679-2722 (2021)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)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)Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs.. INFORMS J. Comput., 32 (4): 1157-1181 (2020)