Article ID: | iaor20062252 |
Country: | United Kingdom |
Volume: | 56 |
Issue: | 3 |
Start Page Number: | 324 |
End Page Number: | 330 |
Publication Date: | Mar 2005 |
Journal: | Journal of the Operational Research Society |
Authors: | Glass C.A., Prgel-Bennett A. |
Keywords: | graph colouring |
In this paper, we develop a new graph colouring strategy. Our heuristic is an example of a so-called polynomially searchable exponential neighbourhood approach. The neighbourhood is that of permutations of the colours of vertices of a subgraph. Our approach provides a solution method for colouring problems with edge weights. Results for initial tests on unweighted