Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293)
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: Partitioning through projections: strong SDP bounds for large graph partition problems |
scientific article; zbMATH DE number 7706523
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning through projections: strong SDP bounds for large graph partition problems |
scientific article; zbMATH DE number 7706523 |
Statements
Partitioning through projections: strong SDP bounds for large graph partition problems (English)
0 references
4 July 2023
0 references
graph partition problems
0 references
semidefinite programming
0 references
cutting planes
0 references
Dykstra's projection algorithm
0 references
augmented Lagrangian methods
0 references
