New methods to color the vertices of a graph
Communications of the ACM
A GRASP for Coloring Sparse Graphs
Computational Optimization and Applications
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
INFORMS Journal on Computing
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization
INFORMS Journal on Computing
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
INFORMS Journal on Computing
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
Heuristic methods for graph coloring problems
Proceedings of the 2005 ACM symposium on Applied computing
GRASP and path relinking for the max-min diversity problem
Computers and Operations Research
Multistart Iterated Tabu Search for Bandwidth Coloring Problem
Computers and Operations Research
A black-box scatter search for optimization problems with integer variables
Journal of Global Optimization
Hi-index | 0.00 |
The bandwidth colouring problem consists of assigning a colour to each vertex of a graph, so that the absolute value of the difference between the colours of adjacent vertices is at least the value of the weight of the associated edge. This problem generalises the classical vertex colouring problem and different heuristics have recently been proposed to obtain high quality solutions. In this paper we describe both memory-based and memory-less methods to solve the bandwidth colouring problem. In particular we propose new constructive and improvement methods based on tabu search and GRASP. Comparison of our results with previously reported instances and existing heuristics indicate that the methods we propose are competitive and require short computational times. Our findings also disclose that memory appears to play a more important role during improvement phases of search than during constructive phases.