Spring 2017

IEORE4573 Computational Discrete Optimization

Instructor: Yuri Faenza

Discrete optimization is a powerful tool for modelling a wide range of problems in science, engineering, and many other areas of technological everyday life. As the name suggests, it deals with problems where the decisions to be made are discrete, for instance: which cities should be connected with a road, how many airplanes should we build, or to whom should a highly-requested job be given

In this course, you will be introduced to those problems and to di fferent techniques for solving them. We will study these techniques mathematically and test their strengths and limits in practice on relevant applications using state-of-the-art solvers. We will focus in particular on transportation (travelling salesman and vehicle routing) and matching (online advertisement and school allocation) problems.


500 W. 120th St., Mudd 315, New York, NY 10027    212-854-2942                 
©2014 Columbia University