Graph coloring with adaptive evolutionary algorithms
From MaRDI portal
Publication:1273650
DOI10.1023/A:1009638304510zbMath0912.68150OpenAlexW1558127485MaRDI QIDQ1273650
J. K. van der Hauw, A. E. Eiben, Jano I. van Hemert
Publication date: 6 January 1999
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009638304510
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (14)
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm ⋮ Iterative coloring extension of a maximum clique ⋮ Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art ⋮ Spectrum graph coloring and applications to Wi-Fi channel assignment ⋮ A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM ⋮ CHECKCOL: improved local search for graph coloring ⋮ Coloring graphs by iterated local search traversing feasible and infeasible solutions ⋮ A wide-ranging computational comparison of high-performance graph colouring algorithms ⋮ Embedding a novel objective function in a two-phased local search for robust vertex coloring ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ The maximum happy induced subgraph problem: bounds and algorithms ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing ⋮ Combinatorial optimization in system configuration design
This page was built for publication: Graph coloring with adaptive evolutionary algorithms
