Coll, P., Dur'an, G., and Moscato, P. (1995). A discussion on some design principles for efficient crossover operators for graph coloring problems. Anales del XXVII Simposio Brasileiro de Pesquisa Operacional.  Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Graph Coloring with Adaptive Evolutionary Algorithms - Eiben, van der Hauw, van.. (1998) (13 citations) (Correct)
....that the SAW ing algorithm uses variable weights to guide its search, while Davis algorithm sees the fixed weights as the problem instance and then tackles this problem as an optimization problem. Coll, Dur an and Moscato discuss graph coloring and crossover operators in a more general context in (Coll et al. 1995). 3 Performance Measures of Algorithms The comparisons between different GAs and comparisons of GAs and DSatur will be based on two different measures: success rate and computational effort. Probabilistic algorithms may find a solution in one run and may not find one in another run. To cope with ....
Coll, P., Dur'an, G., and Moscato, P. (1995). A discussion on some design principles for efficient crossover operators for graph coloring problems. Anales del XXVII Simposio Brasileiro de Pesquisa Operacional.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC