default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNir Halman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j31]Wei Wu
, Hiroki Numaguchi, Nir Halman, Yannan Hu, Mutsunori Yagiura:
Packing squares independently. Theor. Comput. Sci. 1024: 114910 (2025)- 2023
- [j30]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): 235-246 (2023) - [j29]Stanislaw Gawiejnowicz, Nir Halman, Hans Kellerer:
Knapsack problems with position-dependent item weights or profits. Ann. Oper. Res. 326(1): 137-156 (2023) - 2022
- [j28]Tzvi Alon, Nir Halman:
Strongly Polynomial FPTASes for Monotone Dynamic Programs. Algorithmica 84(10): 2785-2819 (2022) - [j27]Nir Halman, Giacomo Nannicini:
Fully polynomial time (Σ , Π )-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs. Math. Program. 195(1): 183-242 (2022) - [j26]Nir Halman, Uriel Vinetz:
An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences. Optim. Lett. 16(4): 1181-1196 (2022) - 2021
- [j25]Tzvi Alon, Nir Halman:
A faster FPTAS for counting two-rowed contingency tables. Discret. Appl. Math. 303: 161-170 (2021) - [j24]Nir Halman, Shmuel Wimer:
Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions. Inf. Process. Lett. 170: 106114 (2021) - [j23]Tzvi Alon, Nir Halman:
Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier. SIAM J. Discret. Math. 35(4): 2679-2722 (2021) - 2020
- [j22]Nir Halman:
Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs. INFORMS J. Comput. 32(4): 1157-1181 (2020) - [j21]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): 643-648 (2020)
2010 – 2019
- 2019
- [j20]Fabián Díaz-Núñez, Nir Halman, Óscar C. Vásquez:
The TV advertisements scheduling problem. Optim. Lett. 13(1): 81-94 (2019) - [j19]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): 469-489 (2019) - [j18]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): 1131-1163 (2019) - 2018
- [j17]Nir Halman, Giacomo Nannicini, James B. Orlin:
On the complexity of energy storage problems. Discret. Optim. 28: 31-53 (2018) - [j16]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): 435-447 (2018) - [j15]Nir Halman, Michael Holzhauser, Sven O. Krumke:
An FPTAS for the knapsack problem with parametric weights. Oper. Res. Lett. 46(5): 487-491 (2018) - [i2]Nir Halman, Giacomo Nannicini:
Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states. CoRR abs/1811.11680 (2018) - 2016
- [j14]Nir Halman:
A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy. Theor. Comput. Sci. 645: 41-47 (2016) - [c5]Nir Halman:
A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy. APPROX-RANDOM 2016: 9:1-9:11 - 2015
- [j13]Nir Halman:
Approximating convex functions via non-convex oracles under the relative noise model. Discret. Optim. 16: 1-16 (2015) - [j12]Nir Halman, Giacomo Nannicini, James B. Orlin:
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. SIAM J. Optim. 25(1): 317-350 (2015) - 2014
- [j11]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): 1725-1796 (2014) - 2013
- [c4]Nir Halman, Giacomo Nannicini, James B. Orlin:
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. ESA 2013: 577-588 - 2012
- [j10]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): 429-446 (2012)
2000 – 2009
- 2009
- [j9]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): 674-685 (2009) - [j8]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): 239-244 (2009) - 2008
- [j7]Nir Halman:
Discrete and Lexicographic Helly-Type Theorems. Discret. Comput. Geom. 39(4): 690-719 (2008) - [j6]Nir Halman:
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) - [c3]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: 91-103 - [c2]Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi:
Fully polynomial time approximation schemes for stochastic dynamic programs. SODA 2008: 700-709 - 2007
- [j5]Nir Halman:
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems. Algorithmica 49(1): 37-50 (2007) - [j4]Nir Halman, Shmuel Onn, Uriel G. Rothblum:
The convex dimension of a graph. Discret. Appl. Math. 155(11): 1373-1383 (2007) - [i1]Nir Halman:
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games are all LP-Type Problems. Equilibrium Computation 2007 - 2005
- [j3]Arie Tamir, Nir Halman:
One-way and round-trip center location problems. Discret. Optim. 2(2): 168-184 (2005) - 2004
- [j2]Nir Halman, Arie Tamir:
Continuous bottleneck tree partitioning problems. Discret. Appl. Math. 140(1-3): 185-206 (2004) - [c1]Nir Halman:
On the Power of Discrete and of Lexicographic Helly-Type Theorems. FOCS 2004: 463-472 - 2003
- [j1]Nir Halman:
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane. Inf. Process. Lett. 86(3): 121-128 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
