See How It Works for details. This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving algorithmic ...

Programming languages: Intermediate experience with Python ... We will learn some divide and conquer algorithms for Integer Multiplication (Karatsuba’s Algorithm), Matrix Multiplication (Strassen’s ...

They will learn the foundations of integer and combinatorial optimization, and apply polyhedral theory to design effective algorithms to solve large-scale integer programs in practice. They will be ...

convex programming and KKT conditions, integer linear programming methods (branch and bound and cutting cutting planes). 20 hours of lectures and 15 hours of seminars in the LT. A reading week will ...

Description: An advanced course on theory and algorithms for integer and mixed integer optimization problems. Convergence of integer programming algorithms, dual relaxations, Benders decomposition, ...

Research areas: Healthcare optimization under uncertainty, Large-scale optimization, stochastic programming, decomposition-based integer programming algorithms (Benders decomposition, Lagrangian ...