Graph coloring by tabu search and simulated annealing. (English) Zbl 0812.68100

The two general approaches of tabu search and simulated annealing are applied to the problem of vertex colouring graphs. Simulation results are presented concerning these two methods, and concerning a sequential colouring method used to generate initial solutions. Tabu search does rather well.


68R10 Graph theory (including graph drawing) in computer science