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 | Theorie | Theory | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Parallel iterative solution-based tabu search for the obnoxious p-median problem
Chang, Jian, (2021)
-
Simulated annealing and tabu search approaches for the Corridor Allocation Problem
Ahonen, Hannu, (2014)
-
Two heuristics for the label printing problem
Alonso-Pecina, Federico, (2022)
- More ...
-
General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem
Li, Mingjie, (2020)
-
Multi-neighborhood tabu search for the maximum weight clique problem
Wu, Qinghua, (2012)
-
A hybrid metaheuristic method for the Maximum Diversity Problem
Wu, Qinghua, (2013)
- More ...