Approximation Algorithms for Linear Programming: From Theory to Growing Practice

Daniel Bienstock

Professor of Operations Research

Columbia University

Daniel Bienstock is Professor of Operations Research at Columbia University.  He obtained the PhD in Operations Research from MIT in 1985, was Assistant Professor at GSIA (Carnegie Mellon) from 1985 to 1986, then spent the next three years at the Combinatorics and Optimization group at Bell Communications Research, and has been at the Industrial Engineering and Operations  Research Department at Columbia University since.  He received the Presidential Young Investigator Award in 1990.  He is now on a half-time leave from Columbia while he pursues consulting interest in the financial services industry.

His research has spanned Graph Theory, Discrete Algorithms and Mathematical Programming.  His current research interests focus on theory and implementation of high-performance algorithms for difficult optimization problems.