Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
The priority-based coloring approach to register allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computers and Operations Research
New methods to color the vertices of a graph
Communications of the ACM
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
A New Genetic Local Search Algorithm for Graph Coloring
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
An adaptive memory algorithm for the k-coloring problem
Discrete Applied Mathematics
Efficient algorithms for finding critical subgraphs
Discrete Applied Mathematics
Graph colouring approaches for a satellite range scheduling problem
Journal of Scheduling
Variable space search for graph coloring
Discrete Applied Mathematics
A Large Neighborhood Search Heuristic for Graph Coloring
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
On the recursive largest first algorithm for graph colouring
International Journal of Computer Mathematics
Combinatorial optimization in system configuration design
Automation and Remote Control
About equivalent interval colorings of weighted graphs
Discrete Applied Mathematics
A search space "cartography" for guiding graph coloring heuristics
Computers and Operations Research
M-GRASP: a GRASP with memory for latency-aware partitioning methods in DVE systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Computers and Operations Research
Parallelization techniques for tabu search
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Parallel simulated annealing algorithm for graph coloring problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
MTPSO algorithm for solving planar graph coloring problem
Expert Systems with Applications: An International Journal
International Journal of Bio-Inspired Computation
Local 7-coloring for planar subgraphs of unit disk graphs
Theoretical Computer Science
A cellular learning automata-based algorithm for solving the vertex coloring problem
Expert Systems with Applications: An International Journal
Distributed graph coloring for self-organization in LTE networks
Journal of Electrical and Computer Engineering - Special issue on LTE/LTE-advanced cellular communication networks
Coloring large graphs based on independent set extraction
Computers and Operations Research
An effective heuristic algorithm for sum coloring of graphs
Computers and Operations Research
A wide-ranging computational comparison of high-performance graph colouring algorithms
Computers and Operations Research
Further results on swarms solving graph coloring
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
An analysis of heuristics for vertex colouring
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Heuristics for a project management problem with incompatibility and assignment costs
Computational Optimization and Applications
An empirical comparison of some approximate methods for graph coloring
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
A hybrid artificial bee colony algorithm for graph 3-coloring
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Note: Quantum annealing of the graph coloring problem
Discrete Optimization
A sequential elimination algorithm for computing bounds on the clique number of a graph
Discrete Optimization
On the efficiency of an order-based representation in the clique covering problem
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Improving the extraction and expansion method for large graph coloring
Discrete Applied Mathematics
Stochastic Learning for SAT-Encoded Graph Coloring Problems
International Journal of Applied Metaheuristic Computing
International Journal of Mobile Network Design and Innovation
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
Computational Optimization and Applications
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Metaheuristics for robust graph coloring
Journal of Heuristics
| Hi-index | 0.00 |
Tabucol is a tabu search algorithm that tries to determine whether the vertices of a given graph can be colored with a fixed number k of colors such that no edge has both endpoints with the same color. This algorithm was proposed in 1987, one year after Fred Glover's article that launched tabu search. While more performing local search algorithms have now been proposed, Tabucol remains very popular and is often chosen as a subroutine in hybrid algorithms that combine a local search with a population based method. In order to explain this unfailing success, we make a thorough survey of local search techniques for graph coloring problems, and we point out the main differences between all these techniques.