Semidefinite programming relaxations for the graph partitioning problem (Q1961466): Difference between revisions
From MaRDI portal
Latest revision as of 11:13, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Semidefinite programming relaxations for the graph partitioning problem |
scientific article |
Statements
Semidefinite programming relaxations for the graph partitioning problem (English)
0 references
21 March 2000
0 references
graph partitioning
0 references
Lagrangian relaxations
0 references
semidefinite programming relaxations
0 references
gangster operator
0 references
0 references