Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem (Q2273653): Difference between revisions
From MaRDI portal
Latest revision as of 12:27, 20 July 2024
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
25 September 2019
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