Solving |Graph Biscetion Problems with Semidefinite Programming Bounds

Jens Clausen, Stefan E. Karisch, F. Rendl

    Research output: Contribution to journalJournal articleResearchpeer-review

    Original languageEnglish
    JournalORSA journal on computing
    Volume12
    Pages (from-to)177 - 191
    ISSN0899-1499
    Publication statusPublished - 2000

    Keywords

    • Branch and Bound
    • Semidefinite Programming
    • Graph Bisection

    Cite this