A method of decomposing integer programs with block angular structure is presented. It is based on the notion of searching for the optimal solution to an integer program among the near-optimal ...

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. Students will be able to ...