Final published version
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review
The Boolean quadric polytope. / Letchford, Adam.
The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications. ed. / Abraham Punnen. Cham, Switzerland : Springer, 2022. p. 97-120.Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review
}
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 -