A tight lower bound for a special case of quadratic 0-1 programming (Q2492664)
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 5032413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight lower bound for a special case of quadratic 0-1 programming |
scientific article; zbMATH DE number 5032413 |
Statements
A tight lower bound for a special case of quadratic 0-1 programming (English)
0 references
14 June 2006
0 references
Binary quadratic optimization
0 references
graph
0 references
NP-complete
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7758434414863586
0 references
0.7515166401863098
0 references
0.750755786895752
0 references
