Letchford, A N (2010) Integer quadratic quasi-polyhedra. In: Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science . Springer, CHE, pp. 258-270.
Full text not available from this repository.Abstract
This paper introduces two fundamental families of `quasi-polyhedra' (polyhedra with a countably infinite number of facets) that arise in the context of integer quadratic programming. It is shown that any integer quadratic program can be reduced to the minimisation of a linear function over a quasi-polyhedron in the first family. Some fundamental properties of the quasi-polyhedra are derived, along with connections to some other well-studied convex sets. Several classes of facet-inducing inequalities are also derived. Finally, extensions to the mixed-integer case are briefly examined.