Some experiments with simulated annealing for coloring graphs (Q581241)

Methods of thermodynamical simulation have been used for several famous combinatorial optimization problems. For graph coloring (i.e. partition of the node set into as few independent sets as possible) we describe a method of simulation. Such an approach is combined with other techniques for graph coloring. Experiments on random graphs show evidence that this combination gives better results than anyone of the original non-combined methods.