Nir Halman's Home Page

Guess from the picture on the right, I am a senior research associate in the Jerusalem School of Business Administration, The Hebrew University of Jerusalem. I got my Ph.D. in Operations Research in 2005, from the School of Mathematical Sciences, Tel-Aviv University. My advisor was Prof. Arik Tamir. I was a post-doc in the Department of Civil and Environmental Engineering at the Massachusetts Institute of Technology. My hosts are Prof. David Simchi-Levi. and Prof. James Orlin. Before that, I was also a post-doc fellow in the Faculty of Industrial Engineering & Management, at the Israel Institute of Technology (Technion). My hosts were Prof. Shmuel Onn and Prof. Uri G. Rothblum. Besides that, I'm interested in: backpacking, panoramic photography, jogging, biology, volcanoes and languages. To my great luck my beloved wife, Tali, shares with me most of those interests. Last summers we were trekking and had a lot of adventures, as you can read and see, in South America, Africa, Iceland, Nepal, Italy/Switzerland, in India and in Ecuador/Peru.

Current Research Interests

Developing New Methodologies to Either Solve or Approximate Optimization Problems. Stochastic Programming with Emphasis on Applications in Supply Chain Management, Logistics, Economics and Finance. Combinatorial Optimization, Stochastic and Data-Driven Dynamic Programming, Optimal Control, Fully Polynomial Time Approximation Schemes, Knapsack Problems.

Additional Research Interests

Geometric Optimization, Helly Type Theorems, Location Theory, Linear Programming, Linear Time Algorithms, Game Theory.

Papers

• Nir Halman and Giacomo Nannicini, Toward Breaking The Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs With Multidimensional Action and Scalar State, SIAM Journal on Optimization 29, pp. 1131-1163, 2019.
• Nir Halman, Mikhail Kovalyov, Allan Quilliot, Dvir Shabtay and Moshe Zofi, Bi-criteria Path Problem with Minimum Length and Maximum Survival Probability, OR Spectrum 41, pp. 469-489, 2019.
• Fabian Diaz-Nunez, Nir Halman and Oscar Vasquez The TV Advertisements Scheduling Problem, Optimization Letters 13, pp. 81-94, 2019.
• Nir Halman, Michael Holzhauser and Sven Krumke An FPTAS for the Knapsack Problem with Parametric Weights, Operations Research Letters 46, pp. 487-491, 2018.
• Nir Halman, Hans Kellerer and Vitaly Strusevich Approximation Schemes for Non-Separable Non-Linear Boolean Programming Problems under Nested Knapsack Constraints, European Journal of Operational Research 270, pp. 435-447, 2018.
• Nir Halman FPTASes for minimizing makespan of deteriorating jobs with non-linear processing times, Proceedings of the second International Workshop on Dynamic Scheduling Problems (IWDSP), 2018.
• Nir Halman, Giacomo Nannicini and Jim Orlin On the complexity of energy storage problems, Discrete Optimization 28, pp. 31-53, 2018.
• Nir Halman A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy, Theoretical Computer Science 645, pp. 41-47, 2016. (A preliminary version of this work appeared in APPROX 2016.) (Power Point presentation )
• Nir Halman Approximating Convex Functions Via Non-Convex Oracles Under The Relative Noise Model, Discrete Optimization 16, pp. 1-16, 2015.
• Nir Halman, Giacomo Nannicini and Jim Orlin A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs, SIAM J. Optimization 25, pp. 317-350, 2015. (A preliminary version of this paper appeared in ESA 2013.)
• Nir Halman, Diego Klabjan, Chung-Lun Li, Jim Orlin and David Simchi-Levi, Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programming, SIAM J. Discrete Math. 28, pp. 1725-1796, 2014. (A preliminary version of this work appeared in SODA 2008.) (Power Point presentation )
• Nir Halman, Jim Orlin and David Simchi-Levi, Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle, Operations Research 60, pp. 429-446, 2012.
• Nir Halman, Chung-Lun Li and David Simchi-Levi, Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks, Operations Research Letters 37, pp. 239-244, 2009. (A preliminary version of this work appeared in APPROX 2008.)
• Nir Halman, Diego Klabjan, Mohamad Mostagir, Jim Orlin and David Simchi-Levi, A Fully Polynomial Time Approximation Scheme for single-item Inventory Control with Discrete Demand, Mathematics of Operations Research 34, pp. 674-685, 2009.
• Nir Halman, Discrete and Lexicographic Helly-Type Theorems, Discrete and Computational Geometry 39, pp. 690-719, 2008. (A preliminary version of this work appeared in FOCS 2004.)
• Nir Halman, On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-type Model, Siam J. Computing 38, pp. 1-45, 2008. (A preliminary version of this work appeared in FOCS 2004.)
• Nir Halman, Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games are all LP-Type Problems, Algorithmica 49, pp. 37-50, 2007.
• Nir Halman, Shmuel Onn and Uriel G. Rothblum, The Convex Dimension of a Graph, Discrete Applied Mathematics 155, pp. 1373-1383, 2007.
• Arie Tamir and Nir Halman, One-Way and Round-Trip Center Location Problems, Discrete Optimization 2, pp. 168-184, 2005.
• Nir Halman and Arie Tamir , Continuous Bottleneck Tree Partitioning Problems, Discrete Applied Mathematics 140, pp. 185-206, 2004.
• Nir Halman, On the Power of Discrete and of Lexicographic Helly-type Theorems, FOCS 2004. (Power Point presentation )
• Nir Halman, Discrete and Lexicographic Helly Theorems and Their Relations to LP-type problems - Ph.D. Dissertation, Tel-Aviv University, 2004.
• Nir Halman, A Linear Time Algorithm for the Weighted Lexicographic Rectilinear 1-Center Problem in the Plane, Information Processing Letters 86 (3), pp. 121-128, 2003. (Power Point presentation )
• Nir Halman, Linear Time Algorithms for Placing Recovery Points in R and on Trees - Technical report RP-SOR-99-05, The School of Mathematical Sciences, Tel Aviv University, 1999.
• Nir Halman, A Linear Time Online Algorithm for the Discrete p-Center Problem in R - Technical report RP-SOR-97-01, The School of Mathematical Sciences, Tel Aviv University, 1997.
• Nir Halman, Optimization of the Diamond Marking Process - M.Sc. Thesis under the direction of Professor Nimrod Megiddo, Tel Aviv University, 1994.

Submitted Papers

• Nir Halman and Uriel Vinetz, An FPTAS for two performance metric alternatives of "Relocation scheduling subject to fixed processing sequences", 2019.
• Tzvi Alon and Nir Halman, A Faster FPTAS for Counting Two-Rowed Contingency Tables, Published online in optimization-online.org on December 13th 2018.
• Nir Halman and Giacomo Nannicini, Fully Polynomial Time (sigma,pi)-Approximation Schemes for Continuous Nonlinear Newsvendor and Continuous Stochastic Dynamic Programs, Published online in optimization-online.org on November 16th 2016.
• Nir Halman, Provably Near-Optimal Approximation Schemes for Implicit Stochastic and for Sample-Based Dynamic Programs, First published online in optimization-online.org on June 8th 2015. Updated version from Feb 4th 2016.

---

Technical Reports

• Nir Halman and Giacomo Nannicini, Fully Polynomial Time (sigma,pi)-Approximation Schemes for Continuous Implicit Stochastic Convex Dynamic Programs, Published online in optimization-online.org on July 7th 2015.
• Nir Halman, Discrete and Lexicographic Helly Theorems and their Relations to LP-Type Problems . Ph.D. Dissertation, School of Mathematics, Tel Aviv University, June 2004.

---

Contact information

Nir Halman, Jerusalem School of Business Administration, MT. Scopus, 91905 ISRAEL Office: +08-948-9953 Home: +077-561-0813 e-mail: "my last name" "at sign" huji "dot" ac "dot" il

---

Last modified: Thu May 30th 09:01:31 EST 2019