Tabu Search For Graph Coloring, T-Colorings And Set T-Colorings

Tabu Search For Graph Coloring, T-Colorings And Set T-Colorings (1998)

by Raphaël Dorne , Jin-Kao Hao

Citations:

22 - 6 self

User correction supplied by mph

Datum	Value	Source
TITLE	Tabu Search For Graph Coloring, T-Colorings And Set T-Colorings	user correction - Legacy Corrections
AUTHOR NAME	Raphaël Dorne	user correction
AUTHOR NAME	Jin-Kao Hao	user correction
ABSTRACT	In this paper, a generic tabu search is presented for three coloring problems: graph coloring, T-colorings and set T-colorings. This algorithm integrates important features such as greedy initialization, solution re-generation, dynamic tabu tenure, incremental evaluation of solutions and constraint handling techniques. Empirical comparisons show that this algorithm approaches the best coloring algorithms and outperforms some hybrid algorithms on a wide range of benchmarks. Experiments on large random instances of T-colorings and set T-colorings show encouraging results.	user correction
YEAR	1998	user correction - Legacy Corrections
CITATIONS	25 found	ParsCit 1.0