Integer Programming

1 Unit · Graduate

Methods for NP-hard discrete optimization problems including general methods like branch and bound and cutting planes, as well as special purpose branch-and-cut methods and heuristics.