Integer Quadratic Quasi-polyhedra

  title={Integer Quadratic Quasi-polyhedra},
  author={Adam N. Letchford},
This paper introduces two fundamental families of ‘quasipolyhedra’ — 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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
3 Citations
15 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 15 references

Integral Matrices

  • M. Newman
  • 1972
Highly Influential
3 Excerpts

On non-convex quadratic programming with box constraints

  • A.N.S. Burer
  • Letchford
  • 2009
1 Excerpt

An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems

  • M. Ramana
  • PhD thesis,
  • 1993
2 Excerpts

Similar Papers

Loading similar papers…