Approximating non-convex quadratic programs by semidefinite and copositive programming (Q3656591)
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 5657768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating non-convex quadratic programs by semidefinite and copositive programming |
scientific article; zbMATH DE number 5657768 |
Statements
13 January 2010
0 references
eigenvalue bound
0 references
quadratic assignment problem
0 references
graph partitioning problem
0 references
0.9283921718597412
0 references
0.8370680809020996
0 references
0.8299974203109741
0 references
0.8226251602172852
0 references
0.8147778511047363
0 references
