Duration: 4 hours. This module will cover integer linear programming and its use in solving NP-hard (combinatorial optimization) problems. We will cover some examples of what integer linear ...

These 0-1 programming problems initially could not be solved with any standard techniques. We employed several approaches to take advantage of the hierarchical structure of variables (ordered by ...