Assoc. Prof. Asaf Levin

Operations Research and Optimization

Overview

Prof. Levin received his Ph.D. degree in Operations Research from Tel Aviv University, Tel Aviv, Israel (2003). From 2003 to 2004 he was a Postdoctoral Fellow at the Minerva Optimization Center, Technion, Haifa, Israel. Then, he joined the Department of Statistics in the Hebrew University of Jerusalem as a lecturer. Prof. Levin joined the Faculty of Industrial Engineering and Management in 2008 as a Senior Lecturer, and since 2011 he is an Associate Professor.

Selected Publications

R. Hassin and A. Levin, ``Synthesis of 2-commodity flow networks", Mathematics of Operations Research, 29, 280-288, 2004.

R. Hassin and A. Levin, ``An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection'', SIAM Journal on Computing, 33, 261-268, 2004.

J. Konemann, A. Levin and A. Sinha, ``Approximating the degree bounded minimum diameter tree problem'', Algorithmica, 41, 17-129, 2005.

R. Hassin and A. Levin, ``A better-than-greedy approximation algorithm for the minimum set cover problem", SIAM Journal on Computing, 35, 189-200, 2005.

E. M. Arkin, R. Hassin and A. Levin, ``Approximations for min-max vehicle routing problems'', Journal of Algorithms, 59, 1-18, 2006.

D. S. Hochbaum and A. Levin, ``Optimizing over consecutive 1's and circular 1's constraints", SIAM Journal on Optimization, 17, 311-330, 2006.

D. S. Hochbaum and A. Levin, ``Methodologies and algorithms for group rankings decision", Management Science, 52, 1394-1408, 2006.

L. Epstein and A. Levin, ``On bin packing with conflicts,''SIAM Journal on Optimization, 19, 1270-1298, 2008.

A. Levin, ``Approximating the unweighted k-set cover problem:greedy meets local search,'' SIAM Journal on Discrete Mathematics, 23, 251-264, 2008.

A. Archer, A. Levin and D. P. Williamson, ``A faster, better approximation algorithm for the minimum latency problem," SIAM Journal on Computing, 37,1472-1498, 2008.

L. Epstein and A. Levin, ``An APTAS for generalized cost variable sized bin packing," SIAM Journal on Computing, 38, 411-428, 2008.

L. Epstein and A. Levin, ``Better bounds for minimizing SONET ADMs,'' Journal of Computer and System Sciences, 75, 122-136, 2009.

L. Epstein and A. Levin, ``A robust APTAS for the classical bin packing problem,'' Mathematical Programming, 119, 33-49, 2009.

J. R. Correa and A. Levin, ``Monotone covering problems with an additional covering constraint,'' Mathematics of Operations Research, 34, 238-248, 2009.

L. Epstein and A. Levin, ``AFPTAS results for common variants of bin packing: A new method for handling the small items", SIAM Journal on Optimization, 20, 3121-3145, 2010.

L. Epstein, A. Levin, J. Mestre and D. Segev, ``Improved approximation guarantees for weighted matching in the semi-streaming model", SIAM Journal on Discrete Mathematics, 25, 1251-1265, 2011.

L. Epstein and A. Levin, ``Bin packing with general cost structures", Mathematical Programming, 132, 355-391, 2012.

L. Epstein, A. Levin, A. Marchetti-Spaccamela, N. Megow, J. Mestre, M. Skutella and L. Stougie, ``Universal sequencing on a single machine", SIAM Journal on Computing, 41, 565-586, 2012.

L. Epstein and A. Levin, ``Robust approximation schemes for cube packing", SIAM Journal on Optimization, 23, 1310-1343, 2013.

L. Epstein and A. Levin, ``An efficient polynomial time approximation scheme for load balancing on uniformly related machines," Mathematical Programming.

Research

Combinatorial optimization
Analysis of algorithms
Approximation algorithms for NP-hard optimization problems
Scheduling
Network optimization problems
Covering and packing problems
Combinatorial optimization

Contact Info

Room 316 Bloomfield Building
+972-4-829-4507