Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889)
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 92005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of uniqueness and local search in quadratic 0-1 programming |
scientific article; zbMATH DE number 92005 |
Statements
Complexity of uniqueness and local search in quadratic 0-1 programming (English)
0 references
16 January 1993
0 references
uniqueness
0 references
quadratic 0-1 problem
0 references
NP-hard
0 references
0 references
0 references
0.9169372
0 references
0.8978406
0 references
0.8978325
0 references
0.8832679
0 references
0.88065207
0 references
0.87358457
0 references
0.87233263
0 references
0.8699334
0 references
