Simple ingredients leading to very efficient heuristics for the maximum clique problem
Year of publication: |
2008
|
---|---|
Authors: | Grosso, Andrea ; Locatelli, Marco ; Pullan, Wayne |
Published in: |
Journal of heuristics. - Norwell, Mass. [u.a.] : Springer Science + Business Media, ISSN 1381-1231, ZDB-ID 1333974-6. - Vol. 14.2008, 6, p. 587-612
|
Subject: | Heuristik | Heuristics | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Scheduling commercial advertisements for television
GarcĂa-Villoria, Alberto, (2015)
-
Trigos, Federico, (2016)
-
An adaptive penalty guided genetic algorithm for scheduling parallel batch processing machines
Xu, Shubin, (2018)
- More ...
-
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Grosso, Andrea, (2008)
-
Branch and cut algorithms for detecting critical nodes in undirected graphs
Summa, Marco Di, (2012)
-
Solving molecular distance geometry problems by global optimization algorithms
Grosso, Andrea, (2009)
- More ...