Integer Programming and Combinatorial Optimization

3 credits · Graduate

The course deals with discrete optimization problems and their complexity. These topics include complexity analysis of algorithms and its drawbacks; solving a system of linear integer equations and inequalities; strongly polynomial algorithms, network flow problems (including matching and branching); polyhedral optimization; branch and bound and lagrangean relaxation.