- https://link.springer.com/chapter/10.1007/978-3-031-04520-2_4
Final published version

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

Published

**The Boolean quadric polytope.** / Letchford, Adam.

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

Letchford, A 2022, The Boolean quadric polytope. in A Punnen (ed.), *The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications.* Springer, Cham, Switzerland, pp. 97-120. https://doi.org/10.1007/978-3-031-04520-2_4

Letchford, A. (2022). The Boolean quadric polytope. In A. Punnen (Ed.), *The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications *(pp. 97-120). Springer. https://doi.org/10.1007/978-3-031-04520-2_4

Letchford A. The Boolean quadric polytope. In Punnen A, editor, The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications. Cham, Switzerland: Springer. 2022. p. 97-120 doi: 10.1007/978-3-031-04520-2_4

@inbook{7efdd246f012445fa76f5aae6b4a22cb,

title = "The Boolean quadric polytope",

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",

keywords = "combinatorial optimisation, integer programming",

author = "Adam Letchford",

year = "2022",

month = may,

day = "1",

doi = "10.1007/978-3-031-04520-2_4",

language = "English",

isbn = "9783031045196",

pages = "97--120",

editor = "Abraham Punnen",

booktitle = "The Quadratic Unconstrained Binary Optimization Problem",

publisher = "Springer",

}

TY - CHAP

T1 - The Boolean quadric polytope

AU - Letchford, Adam

PY - 2022/5/1

Y1 - 2022/5/1

N2 - 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

AB - 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

KW - combinatorial optimisation

KW - integer programming

U2 - 10.1007/978-3-031-04520-2_4

DO - 10.1007/978-3-031-04520-2_4

M3 - Chapter (peer-reviewed)

SN - 9783031045196

SP - 97

EP - 120

BT - The Quadratic Unconstrained Binary Optimization Problem

A2 - Punnen, Abraham

PB - Springer

CY - Cham, Switzerland

ER -