An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- 31 October 2010
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 37 (10), 1822-1832
- https://doi.org/10.1016/j.cor.2010.01.015
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A survey on vertex coloring problemsInternational Transactions in Operational Research, 2009
- Variable space search for graph coloringDiscrete Applied Mathematics, 2008
- A graph coloring heuristic using partial solutions and a reactive tabu schemeComputers & Operations Research, 2008
- An adaptive memory algorithm for the k-coloring problemDiscrete Applied Mathematics, 2008
- A polynomially searchable exponential neighbourhood for graph colouringJournal of the Operational Research Society, 2005
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Partition-distance: A problem and class of perfect graphs arising in clusteringInformation Processing Letters, 2002
- A new genetic local search algorithm for graph coloringPublished by Springer Science and Business Media LLC ,1998
- Searching for Diverse, Cooperative Populations with Genetic AlgorithmsEvolutionary Computation, 1993
- An algorithm for the chromatic number of a graphThe Computer Journal, 1971