Abstract
This chapter focusses on exact solution approaches for QUBO. We first discuss various mixed integer linear programming formulations, compare their relative strength in terms of LP relaxations, and resulting upper bounding strategies. Then, new developments based on semidefinite programming approaches are discussed in detail. The mathematical programming formulations discussed here can be used to solve small size problems and the resulting tight upper bounds on the optimal objective function values can be used in developing specialized enumerative algorithms. Capabilities of some promising enumerative algorithms and solvers are also briefly reviewed.
| Original language | English |
|---|---|
| Title of host publication | The Quadratic Unconstrained Binary Optimization Problem Theory, Algorithms, and Applications |
| Editors | A.P. Punnen |
| Place of Publication | Switzerland |
| Publisher | Springer |
| Chapter | 6 |
| Pages | 139-185 |
| DOIs | |
| Publication status | Published - 2022 |
Fingerprint
Dive into the research topics of 'Mathematical programming models and exact algorithms'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver