An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/ijoc.1120.0542 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/IJOC.1120.0542 / rank | |||
Normal rank | |||
Latest revision as of 06:52, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem |
scientific article |
Statements
An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (English)
0 references
1 March 2017
0 references
graph partition
0 references
graph equipartition
0 references
matrix lifting
0 references
vector lifting
0 references
semidefinite programming
0 references
0 references
0 references
0 references
0 references
0 references
