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
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 12:46, 5 March 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
