A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348)
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: A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization |
scientific article; zbMATH DE number 790487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization |
scientific article; zbMATH DE number 790487 |
Statements
A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (English)
0 references
23 June 1996
0 references
NP-hardness
0 references
polynomially solvable integer quadratic optimization
0 references
0 references
0 references
0.8458526730537415
0 references
0.7766284346580505
0 references
0.7530099749565125
0 references
0.7519353032112122
0 references
0.7506660223007202
0 references
