A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the k-edge connected subgraph problem
scientific article

    Statements

    A branch-and-cut algorithm for the k-edge connected subgraph problem (English)
    0 references
    0 references
    24 November 2010
    0 references
    \(k\)-edge connected graph
    0 references
    polytope
    0 references
    facet
    0 references
    separation
    0 references
    reduction operations
    0 references
    branch-and-cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references