Integer Linear Programming is a technique for solving combinatorial optimization problems exactly using two main techniques: branch and bound, which involves branching on integer variables in a search tree, and cutting planes, which adds linear inequalities to strengthen formulations. MILP modeling formulates problems as integer programs that can then be solved using these techniques.

1. Integer Linear Programming

5. Combinatorial Optimization Problems

6. Solution Approaches

7. An unfortunate situation in a rounding approach to
MILP solving.

8. Rounding

10. There are two main techniques to solve MILP problem exactly: branch and bound
and cutting planes.

11. Branching in a branch and bound approach for MILP.

15. Branching in a branch and bound approach for MILP.

16. MILP Modeling