Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
Year of publication: |
2019
|
---|---|
Authors: | Lu, Zhi ; Hao, Jin-Kao ; Zhou, Yi |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 111.2019, p. 43-57
|
Subject: | Conductance minimization | Graph partitioning | Neighborhood search | Metaheuristics | Adaptive perturbation | Graphentheorie | Graph theory | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem |
-
Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
Fu, Zhang-hua, (2014)
-
Combined neighborhood tabu search for community detection in complex networks
Gach, Olivier, (2016)
-
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
Lai, Xiangjing, (2021)
- More ...
-
Learning driven three-phase search for the maximum independent union of cliques problem
Lu, Zhi, (2024)
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
-
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs
Zhou, Yi, (2018)
- More ...