On the parallel complexity of discrete relaxation in constraint satisfaction networks
Artificial Intelligence
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
New methods to color the vertices of a graph
Communications of the ACM
A machine program for theorem-proving
Communications of the ACM
Coloration Neighbourhood Search With Forward Checking
Annals of Mathematics and Artificial Intelligence
Journal of Artificial Intelligence Research
Symmetry breaking and local search spaces
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A cellular learning automata-based algorithm for solving the vertex coloring problem
Expert Systems with Applications: An International Journal
Multistart Iterated Tabu Search for Bandwidth Coloring Problem
Computers and Operations Research
| Hi-index | 0.05 |
The IMPASSE class of local search algorithms have given good results on many vertex colouring benchmarks. Previous work enhanced IMPASSE by adding the constraint programming technique of forward checking, in order to prune colouration neighbourhoods during search. On several large graphs the algorithm found the best known colourings. This paper extends the work by improving the heuristics and generalising the approach to bandwidth multicolouring. It is shown to give better results than a related search algorithm on an integer programming model, and to be competitive with published results. Experiments indicate that stronger constraint propagation further improves search performance, but that a symmetry breaking technique has unpredictable effects.