The Boolean quadric polytope

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 implication