Exact resolution of integer linear programs

In this section, we present the ideas behind the main known methods for solving exact integer linear programs. The order of our presentation practically follows the chronology in which the various methods were successively developed. At the end of the 1950s, R. Gomory pioneered the first line of research to generalize the simplex algorithm to take account of integrity conditions on variables. This approach is described and illustrated in 4.1 . The second approach, which historically follows closely on the heels of the first, is known as "Branch & Bound" tree search and is described in paragraph...