Solving
Graph Biscetion Problems with Semidefinite Programming Bounds |
J. Clausen, S. E. Karisch, F. Rendl
|
| Keywords | Graph Bisection, Semidefinite Programming, Branch and Bound |
| Type | Journal paper [With referee] |
| Journal | INFORMS Journal of Computing |
| Year | 2000 Vol. 12 pp. 177 - 191 |
| BibTeX data | [bibtex] |
| IMM Group(s) | Operations Research |