Adaptive penalties for evolutionary graph coloring
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 95-106
- https://doi.org/10.1007/bfb0026593
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Constraint-satisfaction problemsPublished by Taylor & Francis ,2004
- Self-adaptivity for constraint satisfaction: learning penalty functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Adaptation in evolutionary computation: a surveyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Problem structure heuristics and scaling behavior for genetic algorithmsArtificial Intelligence, 1996
- A New Representation and Operators for Genetic Algorithms Applied to Grouping ProblemsEvolutionary Computation, 1994
- The greedy coloring is a bad probabilistic algorithmJournal of Algorithms, 1991
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOperations Research, 1991
- Register allocation & spilling via graph coloringPublished by Association for Computing Machinery (ACM) ,1982
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- An application of graph coloring to printed circuit testingIEEE Transactions on Circuits and Systems, 1976