Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem

DOI10.1016/j.tcs.2007.01.023zbMath1128.68111OpenAlexW2007712397MaRDI QIDQ884452

El-Ghazali Talbi, Benjamin Weinberg

Publication date: 6 June 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.01.023

zbMATH Keywords

partitioning problemsgraph coloring problemlandscape analysissearch space symmetry

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Coloring of graphs and hypergraphs (05C15)

Uses Software

• Algorithm 548

Cites Work

• Unnamed Item
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Hybrid evolutionary algorithms for graph coloring
• A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile