Letchford, Adam (2022) The Boolean quadric polytope. In: The Quadratic Unconstrained Binary Optimization Problem. Springer, Cham, Switzerland, pp. 97-120. ISBN 9783031045196
Text (qubo-chapter)
qubo_chapter.pdf - Accepted Version
Restricted to Repository staff only until 1 May 2024.
Available under License Other.
Download (356kB)
qubo_chapter.pdf - Accepted Version
Restricted to Repository staff only until 1 May 2024.
Available under License Other.
Download (356kB)
Official URL: https://doi.org/10.1007/978-3-031-04520-2_4
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
Item Type:
Contribution in Book/Report/Proceedings
Subjects:
Departments:
ID Code:
172098
Deposited By:
Deposited On:
12 Oct 2022 14:30
Refereed?:
Yes
Published?:
Published
Last Modified:
21 Sep 2023 04:05