Stochastic programming with emphasis on applications in supply chain management, logistics, revenue management, economics and finance. Combinatorial optimization...
Education
Ph.D. Tel Aviv University, 2005
Publications
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, Chung-Lun Li, Jim Orlin and David Simchi-Levi,Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programming,Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 700-709, 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- in 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.
Current Research
Development of optimization methods that yield efficient algorithms in combinatorial optimization. If the achieved solution is optimal, the focus is on fast running time. If the achieved solution is an approximation, the focus is on a bounded-error approximation (e.g., FPTAS) and fast execution time.
Emphasis on applications in supply chain management, revenue management, logistics, economics and finance.
Methodologies: Dynamic programming, integer programming, integer programming, stochastic programing.
Honors And Awards
Awards:
Recipient of Operations Research Society In Israel (ORSIS) Excellence Prize Dedicated to Young Researchers. 2008
Recipient of the Discrete Optimization Top Cited Article 2005-2010 Award. 2011
Grants:
National Science Foundation (NSF) "Nearly Optimal Solutions for Stochastic Optimization Problems”, with Jim Orlin and David Simchi-Levi from MIT. $120,000/$340,000. 2008-2011.
: European Union 7th Framework Project Marie Curie International Reintigration
Grant, "Efficient Approximation for Stochastic Optimization”, 100,000/100,000 euro. 2010-2014
