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

DOI10.1016/J.TCS.2007.01.023MaRDI QIDQ884452zbMATH OpenOpenAlexFDO

Authors 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

graph coloring problemlandscape analysispartitioning problemssearch space symmetry

Mathematics Subject Classification ID

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

Recommendations

• Evolutionary Computation in Combinatorial Optimization
• Constraints for symmetry breaking in graph representation
• A search space ``cartography for guiding graph coloring heuristics
• Variable space search for graph coloring
• An ordering-based genetic approach to graph coloring

Cites work

• A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• scientific article; zbMATH DE number 558543 (Why is no real title available?)
• Hybrid evolutionary algorithms for graph coloring

Cited in

(1)

• Evolutionary Computation in Combinatorial Optimization

Describes a project that uses

Uses Software

• Algorithm 548

This page was built for publication: Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884452)