Discrete Optimization Theory

3 Credits

Modeling with integer variables; enumeration and cutting plane methods; decomposition algorithms; branch and bound methods; computational complexity and software issues; special combinatorial optimization problems; parallel algorithms for integer programming.