Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
From MaRDI portal
Publication:1417848
DOI10.1023/A:1027312403532zbMath1098.68096OpenAlexW1606171447MaRDI QIDQ1417848
Adam Prügel-Bennett, Celia A. Dr. Glass
Publication date: 6 January 2004
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1027312403532
genetic algorithmsgraph theoryfrequency assignment problemchromatic number problemheuristics: local search
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
When a genetic algorithm outperforms hill-climbing ⋮ An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem ⋮ A semidefinite programming-based heuristic for graph coloring ⋮ An improved ant colony optimisation heuristic for graph colouring ⋮ A wide-ranging computational comparison of high-performance graph colouring algorithms ⋮ A survey of local search methods for graph coloring ⋮ Improving the extraction and expansion method for large graph coloring ⋮ An efficient memetic algorithm for the graph partitioning problem ⋮ Graph coloring by multiagent fusion search
This page was built for publication: Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
