Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem |
scientific article; zbMATH DE number 5166300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem |
scientific article; zbMATH DE number 5166300 |
Statements
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (English)
0 references
21 June 2007
0 references
quadratic 0-1 programming
0 references
special case
0 references
local minima
0 references
constant rank matrix
0 references
stable sets
0 references
0 references
0.9372995
0 references
0.9349802
0 references
0.9311418
0 references
0.92193675
0 references
0.9214031
0 references
0.91650933
0 references
0.9102328
0 references
0 references
0.9058032
0 references
