Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPT3 / rank | |||
Normal rank | |||
Revision as of 08:41, 29 February 2024
scientific article; zbMATH DE number 6544364
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
