Nir Halman

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