A review on algorithms for maximum clique problems
Year of publication: |
2015
|
---|---|
Authors: | Wu, Qinghua ; Hao, Jin-Kao |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 242.2015, 3 (1.5.), p. 693-709
|
Subject: | Maximum clique problems | Exact algorithms | Heuristics | Applications | Theorie | Theory | Algorithmus | Algorithm | Heuristik | Mathematische Optimierung | Mathematical programming |
-
Order picking problems under weight, fragility and category constraints
Chabot, Thomas, (2017)
-
Research trends in combinatorial optimization
Weinand, Jann Michael, (2022)
-
An exact algorithm for the Blocks Relocation Problem with new lower bounds
Quispe, Kent E. Yucra, (2018)
- More ...
-
An effective heuristic algorithm for sum coloring of graphs
Wu, Qinghua, (2012)
-
An adaptive multistart tabu search approach to solve the maximum clique problem
Wu, Qinghua, (2013)
-
A hybrid metaheuristic method for the Maximum Diversity Problem
Wu, Qinghua, (2013)
- More ...