We will learn some divide and conquer algorithms for Integer Multiplication (Karatsuba’s Algorithm), Matrix Multiplication (Strassen’s Algorithm), Fast Fourier Transforms (FFTs), and Finding Closest ...

We present integer linear programming formulation and a simple yet elegant dynamic programming algorithm. We will present a 3/2 factor approximation algorithm by Christofides and discuss some ...

Integer programming is a crucial branch of mathematical optimisation ... thereby providing tighter bounds that enhance our theoretical understanding and practical performance of solver algorithms ...

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

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 ...

MG4C6.1 Foundations of Mathematical Programming: An introduction to linear programming and to the theory of duality. MG4C6.2 Mathematical Programming: Introduction to theory and the solution of linear ...

Introduction to theory and the solution of linear and nonlinear programming problems: including linear programming, duality, the simplex method, lagrangian duality, convex programming and KKT ...

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