Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676)
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: Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem |
scientific article; zbMATH DE number 6544364
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem |
scientific article; zbMATH DE number 6544364 |
Statements
Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (English)
0 references
23 February 2016
0 references
vertex separators
0 references
eigenvalue bounds
0 references
semidefinite programming bounds
0 references
graph partitioning
0 references
large scale
0 references
0 references
0.8718721270561218
0 references
0.8346870541572571
0 references
0.8179882764816284
0 references
0.8035545945167542
0 references
0.8024376630783081
0 references
