The Boolean quadric polytope

Letchford, Adam (2022) The Boolean quadric polytope. In: The Quadratic Unconstrained Binary Optimization Problem : Theory, Algorithms, and Applications. Springer, Cham, Switzerland, pp. 97-120. ISBN 9783031045196

Text (qubo-chapter)
qubo_chapter.pdf - Accepted Version
Available under License Other.
Download (356kB)

Abstract

When developing an exact algorithm for a combinatorial optimisation problem, it often helps to have a good understanding of certain polyhedra associated with that problem. In the case of quadratic unconstrained Boolean optimisation, the polyhedron in question is called the Boolean quadric polytope. This chapter gives a brief introduction to polyhedral theory, reviews the literature on the Boolean quadric polytope and related polyhedra, and explains the algorithmic implications