Using tabu search techniques for graph coloring (Q580987): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3715148 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some experiments with simulated annealing for coloring graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Future paths for integer programming and links to artificial intelligence / rank | |||
Normal rank | |||
Revision as of 11:27, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using tabu search techniques for graph coloring |
scientific article |
Statements
Using tabu search techniques for graph coloring (English)
0 references
1987
0 references
Tabu search techniques are used for moving step by step towards the minimum value of a function. A tabu list of forbidden movements is updated during the iterations to avoid cycling and being trapped in local minima. Such techniques are adapted to graph coloring problems. We show that they provide almost optimal colorings of graphs having up to 1000 nodes and their efficiency is shown to be significantly superior to the famous simulated annealing.
0 references
graph coloring
0 references
tabu search
0 references
simulated annealing
0 references
