The node capacitated graph partitioning problem: A computational study (Q1290618)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The node capacitated graph partitioning problem: A computational study
scientific article

    Statements

    The node capacitated graph partitioning problem: A computational study (English)
    0 references
    3 June 1999
    0 references
    branch-and-cut algorithm
    0 references
    clustering
    0 references
    graph partitioning
    0 references
    layout of electronic circuits
    0 references
    \(k\)-partitioning
    0 references
    valid inequalities
    0 references
    separation heuristics
    0 references
    equipartitioning
    0 references
    finite element methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers