Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134): Difference between revisions
From MaRDI portal
Latest revision as of 19:13, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems |
scientific article |
Statements
Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (English)
0 references
23 November 2017
0 references
combinatorial optimization
0 references
quadratic unconstrained binary optimization
0 references
preprocessing
0 references
graph reduction
0 references
quantum annealing
0 references
0 references
0 references
0 references
0 references
