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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of heuristics Jg. 24; H. 1; S. 1 - 24
Hauptverfasser:	Moalic, Laurent, Gondran, Alexandre
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.02.2018 Springer Nature B.V Springer Verlag
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!