( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand.

, , , , и . 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.

Nir Kahn

Nir Oren

Nir Levy

Nir Yogev

Alois Nirschl

 

Другие публикации лиц с тем же именем

A faster FPTAS for counting two-rowed contingency tables., и . Discret. Appl. Math., (2021)The TV advertisements scheduling problem., , и . Optim. Lett., 13 (1): 81-94 (2019)Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier., и . SIAM J. Discret. Math., 35 (4): 2679-2722 (2021)Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints., , и . Eur. J. Oper. Res., 270 (2): 435-447 (2018)On the complexity of energy storage problems., , и . Discret. Optim., (2018)A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand., , , , и . Math. Oper. Res., 34 (3): 674-685 (2009)A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy.. APPROX-RANDOM, том 60 из LIPIcs, стр. 9:1-9:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Knapsack problems with position-dependent item weights or profits., , и . Ann. Oper. Res., 326 (1): 137-156 (июля 2023)A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times.. J. Sched., 23 (6): 643-648 (2020)Discrete and Lexicographic Helly-Type Theorems.. Discret. Comput. Geom., 39 (4): 690-719 (2008)