Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem (Q2273653)

From MaRDI portal
Revision as of 13:27, 20 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
Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
scientific article

    Statements

    Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem (English)
    0 references
    0 references
    25 September 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    conductance minimization
    0 references
    graph partitioning
    0 references
    neighborhood search
    0 references
    metaheuristics
    0 references
    adaptive perturbation
    0 references
    0 references
    0 references
    0 references