Academic
Publications
A Cooperative Search Method for the k-Coloring Problem

A Cooperative Search Method for the k-Coloring Problem,10.1007/s10852-008-9081-1,Journal of Mathematical Modelling and Algorithms,Hend Bouziri,El-Ghaz

A Cooperative Search Method for the k-Coloring Problem  
BibTex | RIS | RefWorks Download
In this paper, a cooperative search method, based on a multi-agent structure is developed to deal with the k-coloring problem. Three agents coordinate using an adaptive memory, a search agent, an intensification agent and a diversification agent. We use the results of a preliminary fitness landscape study to adjust the navigation strategy in the solution space and to fix the search parameters. Our method provides competitive results and it is fast when compared with best existing techniques on instances extracted from the second DIMACS challenge.
Journal: Journal of Mathematical Modelling and Algorithms - JMMA , vol. 7, no. 2, pp. 125-142, 2008
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.