Lower bound improvement and forcing rule for quadratic binary programming (Q2506180)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5058175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bound improvement and forcing rule for quadratic binary programming |
scientific article; zbMATH DE number 5058175 |
Statements
Lower bound improvement and forcing rule for quadratic binary programming (English)
0 references
28 September 2006
0 references
quadratic binary programming
0 references
lower bound
0 references
forcing rule
0 references
branch and bound algorithm
0 references
0 references
0 references
0 references
0 references
0.9400749
0 references
0.9009716
0 references
0.89273196
0 references
0 references
0.8900031
0 references
0.8896675
0 references
0.8893103
0 references
