An effective multilevel tabu search approach for balanced graph partitioning
Year of publication: |
2011
|
---|---|
Authors: | Benlic, Una ; Hao, Jin-Kao |
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. 38.2011, 7, p. 1066-1075
|
Subject: | Graphentheorie | Graph theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | USA | United States | Theorie | Theory |
-
A derandomized approximation algorithm for the critical node detection problem
Ventresca, Mario, (2014)
-
Dolgui, Alexandre, (2008)
-
A wide branching strategy for the graph coloring problem
Morrison, David Robert, (2014)
- More ...
-
Breakout local search for maximum clique problems
Benlic, Una, (2013)
-
Lower bounds for the ITC-2007 curriculum-based course timetabling problem
Hao, Jin-Kao, (2011)
-
Heuristic search to the capacitated clustering problem
Zhou, Qing, (2019)
- More ...