Here is the story of how this paper was written. (a) Independently, Alan and Joe discovered this easy theorem: if the right hand side consists of integers, and if the matrix is totally unimodular, then the vertices of the polyhedron defined by the linear inequalities will all be integral. This is easy to prove and useful. As far as we know, this is the only part of our theorem that anyone has ever used. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hoffman, A. J., & Kruskal, J. B. (2010). Integral boundary points of convex polyhedra. In 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art (pp. 49–76). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-68279-0_3
Mendeley helps you to discover research relevant for your work.