Home > Research > Publications & Outputs > The Boolean quadric polytope

Associated organisational unit

Electronic data

  • qubo-chapter

    Accepted author manuscript, 348 KB, PDF document

    Embargo ends: 1/05/24

    Available under license: Other


Text available via DOI:

View graph of relations

The Boolean quadric polytope

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter (peer-reviewed)peer-review

Publication date1/05/2022
Host publicationThe Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications
EditorsAbraham Punnen
Place of PublicationCham, Switzerland
Number of pages24
ISBN (electronic)9783031045202
ISBN (print)9783031045196
<mark>Original language</mark>English


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