Some experiments with simulated annealing for coloring graphs (Q581241)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some experiments with simulated annealing for coloring graphs |
scientific article; zbMATH DE number 4018779
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some experiments with simulated annealing for coloring graphs |
scientific article; zbMATH DE number 4018779 |
Statements
Some experiments with simulated annealing for coloring graphs (English)
0 references
1987
0 references
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.
0 references
simulated annealing
0 references
heuristics
0 references
scheduling
0 references
thermodynamical simulation
0 references
graph coloring
0 references
0 references
0 references
