Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989)

From MaRDI portal
Revision as of 21:34, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Engineering Branch-and-Cut Algorithms for the Equicut Problem
scientific article

    Statements

    Engineering Branch-and-Cut Algorithms for the Equicut Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    equicut
    0 references
    maximum-cut
    0 references
    bisection
    0 references
    graph partitioning
    0 references
    linear programming
    0 references
    semidefinite programming
    0 references
    branch-and-cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references