Integer programming is the youngest branch of mathematical programming: its development started in the late 1950s. A (linear or nonlinear) integer program is a linear or nonlinear program whose variables are constrained to be integer. We will consider here only the linear case, although there exist extensions of the techniques to be discussed to nonlinear integer programming.
- Hoffman, A.J., and J.B. Kruskal. 1958. Integral boundary points of convex polyhedra. In Linear inequalities and related systems, ed. H.W. Kuhn and A.W. Tucker, 223–246. Princeton: Princeton University Press.Google Scholar