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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of heuristics Vol. 24; no. 1; pp. 1 - 24
Main Authors:	Moalic, Laurent, Gondran, Alexandre
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2018 Springer Nature B.V Springer Verlag
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!