A modified noising algorithm for the graph partitioning problem (Q4397095)

From MaRDI portal
Revision as of 14:02, 30 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126528073, #quickstatements; #temporary_batch_1722291251637)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1170307
Language Label Description Also known as
English
A modified noising algorithm for the graph partitioning problem
scientific article; zbMATH DE number 1170307

    Statements

    A modified noising algorithm for the graph partitioning problem (English)
    0 references
    0 references
    0 references
    0 references
    30 June 1998
    0 references
    0 references
    combinatorial optimization
    0 references
    NP-hard
    0 references
    graph partitioning
    0 references
    clique partitioning
    0 references
    heuristics
    0 references
    noising method
    0 references
    simulated annealing
    0 references
    0 references
    0 references