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.
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.