A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm<sup>1</sup> (Q3807879): Difference between revisions
From MaRDI portal
Latest revision as of 10:00, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm<sup>1</sup> |
scientific article |
Statements
A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm<sup>1</sup> (English)
0 references
1988
0 references
duality
0 references
tight bounds
0 references
branch and bound
0 references
Boolean quadratic optimization
0 references
Superlinear convergence
0 references