David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
This paper first describes a theory and algorithms for asymptotic integer programs. Next, a class of polyhedra is introduced. The vertices of these polyhedra provide solutions to the asymptotic integer programming problem; their faces are cutting planes for the general integer programming problem and, to some extent, the polyhedra coincide with the convex hull of the integer points satisfying a linear programming problem. These polyhedra are next shown to be cross sections of more symmetric higher dimensional polyhedra whose properties are then studied. Some algorithms for integer programming, based on a knowledge of the polyhedra, are outlined. © 1969.
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Igor Devetak, Andreas Winter
ISIT 2003
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985