This project proposes an efficient memetic algorithm for the graph coloring problem. Authors : L. Moalic (laurent.moalic@uha.fr) and A. Gondran (alexandre.gondran@enac.fr). Details are presented in the paper "Variations on memetic algorithms for graph coloring problems" :
