Integer Linear Programming

This chapter provides an introduction to Integer Linear Programming (ILP). After reviewing the effective modeling of a problem via ILP, the chapter describes the two main solving procedures for integer programs, i.e., branch-and-bound and cutting planes. The theory of totally unimodular matrices is introduced to account for problems whose models have naturally integer solutions. State-of-the-art solvers for mixed-integer linear programs are described at the conclusion.