Variations on memetic algorithms for graph coloring problems

Graph vertex coloring with a given number of colors is a well-known and much-studied NP-complete problem. The most effective methods to solve this problem are proved to be hybrid algorithms such as memetic algorithms or quantum annealing. Those hybrid algorithms use a powerful local search inside a...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of heuristics Ročník 24; číslo 1; s. 1 - 24
Hlavní autori:	Moalic, Laurent, Gondran, Alexandre
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2018 Springer Nature B.V Springer Verlag
Predmet:	Algorithms Artificial Intelligence Calculus of Variations and Optimal Control; Optimization Computer Science Computing time Evolutionary algorithms Graph coloring Management Science Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization and Control Coloring Graph Combinatorial optimization Metaheuristics Evolutionary tabu search coloring evolutionary memetic graph
ISSN:	1381-1231, 1572-9397
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!