Instructor. Yuri Faenza, IEOR Department, Columbia University. Contact.

When / Where. MW 11:40-12:55am in 602 Northwest Corner Building.

Syllabus. Here.

Content. Combinatorial optimization is a branch of optimization with connections to areas of purely theoretical research such as graph theory, theoretical computer science, and combinatorics, and is used in applications such as market design, logistics, and machine learning, among others.
This course is the first edition of an advanced Ph.D. class that the IEOR department wished to be taught at regular intervals. It is intended for Ph.D. students who have already gained some basic knowledge in combinatorial optimization and are interested in learning about advanced problems, algorithms, and techniques for the study of combinatorial optimization problems. We will cover a selected list of advanced topics in the area, chosen among those that are at the forefront of current research and/or have most connections with applications. A list of topics covered in every class, notes, possible projects and a tentative full list of topics is here.