Nir Halman's Home Page

As you might guess from the picture on the right, 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'm currently 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 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

Stochastic Programming with Emphasis on Applications in Supply Chain Management, Logistics, Economics and Finance. Combinatorial Optimization, Stochastic Dynamic Programming, Fully Polynomial Time Approximation Schemes.

Other Research Interests

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

Papers

• N. Halman, D. Klabjan, C.-L. Li, J. Orlin and D. Simchi-Levi, Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programming , to appear in SODA 2008.
• N. Halman, Discrete and Lexicographic Helly-Type Theorems , to appear in Discrete and Computational Geometry, 2008. (A preliminary version of this work appeared in FOCS 2004).
• N. Halman, On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-type Model , to appear in Siam J. Computing, 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.

Contact information

Nir Halman,
The Department of Civil and Environmental Engineering
1-170 MIT
Cambridge 02139, MA
USA

Office:    +617-253-3528
Home:      +617-547-1302

e-mail:  "my last name" "at sign"  mit "dot" edu