Daniel Bienstock
342 S.W. Mudd Mail Code: 4704
New York, NY 10027
Phone: +1 212 854 3407
Email:
Home Page
Research Specialty
applied mathematics, methodology and high-performance implementation of optimization algorithms, applications of optimization: preventing national-scale blackouts, emergency management, approximate solution of massively large optimization problems, higher-dimensional reformulation techniques for integer programming, robust optimizationEducation
Ph.D.,
Operations Research, M.I.T. 1985
Biography
Professor Daniel Bienstock first joined Columbia University's Industrial Engineering and Operations Research Department in 1989 and became a joint faculty member in the Department of Applied Physics and Applied Mathematics in 2008. Professor Bienstock teaches courses on integer programming and optimization.
Before joining Columbia University, Professor Bienstock was involved in combinatorics and optimization research at Bellcore. He has also participated in collaborative research with Bell Laboratories (Lucent), AT&T Laboratories, Tellium, and Lincoln Laboratory on various network design problems.
Professor Bienstock's teaching and research interests include
combinatorial optimization and integer programming, parallel computing
and applications to networking. Professor Bienstock has published
in journals such as Math Programming, SIAM, and Math of OR.
Selected Publications
The N - k Problem in Power Grids: New Models, Formulations and Computation (with A. Verma), submitted to SIAM J. Optimization.
Faster approximation algorithms for covering and packing problems (with G. Iyengar), SIAM J. Computing 35 (2006) 825-854.
Subset Algebra Lift Operators for 0-1 Integer Programming (with M. Zuckerberg), SIAM J. Optimization 15 (2004) 63-95.
Potential Function Methods for Approximately Solving Linear Programming Problems Theory and Practice. ISBN: 1-4020-7173-6, Kluwer Academic Publishers, Boston (2002).