David Bergman Receives Prestigious Association for Constraint Programming Doctoral Thesis Award

David BergmanDavid Bergman, an assistant professor of Operations and Information Management in the School of Business, has been selected as the winner of this year’s Association for Constraint Programming Doctoral Thesis Award.
The annual award is given to a researcher who has completed his/her thesis in the area of constraint programming. Bergman will present his thesis at this year’s 20th International Conference on Principles and Practices of Constraint Programming in Lyon, France, in September.

Bergman’s thesis is titled, “New Techniques for Discrete Optimization,” and it explores new methodological approaches to discrete optimization problems, an area of operations research which finds an increasing number of applications in fields such as finance, healthcare, and logistics, to name just a few. His thesis provides both theoretical insights and important algorithmic discoveries which together improve upon existing state-of-the-art technology.

He completed his Ph.D. in 2013 at Carnegie Mellon University in Algorithms, Combinatorics, and Optimization, a joint program administered by the Tepper School of Business, the Department of Mathematical Sciences, and the Computer Science Department. Bergman’s thesis advisors were John N. Hooker and Willem-Jan van Hoeve.

An abstract of “New Techniques for Discrete Optimization” is available here.

Facebook Twitter LinkedIn Addthis