An adaptive multistart tabu search approach to solve the maximum clique problem
Year of publication: |
2013
|
---|---|
Authors: | Wu, Qinghua ; Hao, Jin-Kao |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 26.2013, 1, p. 86-108
|
Subject: | tabu search | maximum clique | constrained neighborhood | informed restart | combinatorial optimization | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Suchtheorie | Search theory | Algorithmus | Algorithm |
-
Effective metaheuristic algorithms for the minimum differential dispersion problem
Wang, Yang, (2017)
-
Iterated local search with tabu search for the weighted vertex coloring problem
Nogueira, Bruno, (2021)
-
Tabu search for the cyclic bandwidth problem
Rodriguez-Tello, Eduardo, (2015)
- More ...
-
An effective heuristic algorithm for sum coloring of graphs
Wu, Qinghua, (2012)
-
A hybrid metaheuristic method for the Maximum Diversity Problem
Wu, Qinghua, (2013)
-
A review on algorithms for maximum clique problems
Wu, Qinghua, (2015)
- More ...