Nir Halman

Publication Activity (10 Years)

Years Active: 2003-2023
Publications (10 Years): 19

Top Topics

Stochastic Dynamic

Top Venues

SIAM J. Discret. Math.

Discret. Optim.

Publications

Stanislaw Gawiejnowicz, Nir Halman, Hans Kellerer
Knapsack problems with position-dependent item weights or profits. Ann. Oper. Res. 326 (1) (2023)
Nir Halman, Mikhail Y. Kovalyov, Alain Quilliot
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint. 4OR 21 (2) (2023)
Nir Halman, Uriel Vinetz
An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences. Optim. Lett. 16 (4) (2022)
Tzvi Alon, Nir Halman
Strongly Polynomial FPTASes for Monotone Dynamic Programs. Algorithmica 84 (10) (2022)
Nir Halman, Giacomo Nannicini
Fully polynomial time (Σ , Π )-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs. Math. Program. 195 (1) (2022)
Nir Halman, Shmuel Wimer
Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions. Inf. Process. Lett. 170 (2021)
Tzvi Alon, Nir Halman
Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier. SIAM J. Discret. Math. 35 (4) (2021)
Tzvi Alon, Nir Halman
A faster FPTAS for counting two-rowed contingency tables. Discret. Appl. Math. 303 (2021)
Nir Halman
Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs. INFORMS J. Comput. 32 (4) (2020)
Nir Halman
A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times. J. Sched. 23 (6) (2020)
Nir Halman, Giacomo Nannicini
Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States. SIAM J. Optim. 29 (2) (2019)
Fabián Díaz-Núñez, Nir Halman, Óscar C. Vásquez
The TV advertisements scheduling problem. Optim. Lett. 13 (1) (2019)
Nir Halman, Mikhail Y. Kovalyov, Alain Quilliot, Dvir Shabtay, Moshe Zofi
Bi-criteria path problem with minimum length and maximum survival probability. OR Spectr. 41 (2) (2019)
Nir Halman, Giacomo Nannicini
Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states. CoRR (2018)
Nir Halman, Giacomo Nannicini, James B. Orlin
On the complexity of energy storage problems. Discret. Optim. 28 (2018)
Nir Halman, Hans Kellerer, Vitaly A. Strusevich
Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints. Eur. J. Oper. Res. 270 (2) (2018)
Nir Halman, Michael Holzhauser, Sven O. Krumke
An FPTAS for the knapsack problem with parametric weights. Oper. Res. Lett. 46 (5) (2018)
Nir Halman
A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy. Theor. Comput. Sci. 645 (2016)
Nir Halman
A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy. APPROX-RANDOM (2016)
Nir Halman
Approximating convex functions via non-convex oracles under the relative noise model. Discret. Optim. 16 (2015)
Nir Halman, Giacomo Nannicini, James B. Orlin
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. SIAM J. Optim. 25 (1) (2015)
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi
Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs. SIAM J. Discret. Math. 28 (4) (2014)
Nir Halman, Giacomo Nannicini, James B. Orlin
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. ESA (2013)
Nir Halman, James B. Orlin, David Simchi-Levi
Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle. Oper. Res. 60 (2) (2012)
Nir Halman, Diego Klabjan, Mohamed Mostagir, James B. Orlin, David Simchi-Levi
A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand. Math. Oper. Res. 34 (3) (2009)
Nir Halman, Chung-Lun Li, David Simchi-Levi
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks. Oper. Res. Lett. 37 (4) (2009)
Nir Halman
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model. SIAM J. Comput. 38 (1) (2008)
Nir Halman
Discrete and Lexicographic Helly-Type Theorems. Discret. Comput. Geom. 39 (4) (2008)
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi
Fully polynomial time approximation schemes for stochastic dynamic programs. SODA (2008)
Nir Halman, Chung-Lun Li, David Simchi-Levi
Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks. APPROX-RANDOM (2008)
Nir Halman
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems. Algorithmica 49 (1) (2007)
Nir Halman
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games are all LP-Type Problems. Equilibrium Computation (2007)
Nir Halman, Shmuel Onn, Uriel G. Rothblum
The convex dimension of a graph. Discret. Appl. Math. 155 (11) (2007)
Arie Tamir, Nir Halman
One-way and round-trip center location problems. Discret. Optim. 2 (2) (2005)
Nir Halman, Arie Tamir
Continuous bottleneck tree partitioning problems. Discret. Appl. Math. 140 (1-3) (2004)
Nir Halman
On the Power of Discrete and of Lexicographic Helly-Type Theorems. FOCS (2004)
Nir Halman
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane. Inf. Process. Lett. 86 (3) (2003)