An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
From MaRDI portal
Publication:976050
DOI10.1016/J.COR.2010.01.015zbMATH Open1188.90269OpenAlexW2118944864MaRDI QIDQ976050FDOQ976050
Authors: Daniel Cosmin Porumbel, Pascale Kuntz, Jin-Kao Hao 
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.01.015
Recommendations
- scientific article; zbMATH DE number 1342294
- Graph coloring with adaptive evolutionary algorithms
- Hybrid evolutionary algorithms for graph coloring
- scientific article; zbMATH DE number 1703855
- Two novel evolutionary formulations of the graph coloring problem
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Efficient graph coloring with parallel genetic algorithms
- An application of a new hybrid genetic algorithm to graph coloring
graph coloringpopulation managementdiversity controlmemetic and hybrid algorithmmulti-parent crossover
Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of local search methods for graph coloring
- Title not available (Why is that?)
- A search space ``cartography for guiding graph coloring heuristics
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- A survey on vertex coloring problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A memetic algorithm for graph coloring
- Partition-distance: A problem and class of perfect graphs arising in clustering
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- Using tabu search techniques for graph coloring
- Variable space search for graph coloring
- An adaptive memory algorithm for the \(k\)-coloring problem
- A metaheuristic approach for the vertex coloring problem
- Feature Article—Genetic Algorithms for the Operations Researcher
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A variable neighborhood search for graph coloring.
- The algebra of genetic algorithms
- Title not available (Why is that?)
- Some experiments with simulated annealing for coloring graphs
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
- An algorithm for the chromatic number of a graph
- Title not available (Why is that?)
- An evolutionary approach for bandwidth multicoloring problems
- A Large Neighborhood Search Heuristic for Graph Coloring
Cited In (22)
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
- An extraction and expansion approach for graph coloring
- Improving the extraction and expansion method for large graph coloring
- Meta-heuristics and artificial intelligence
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- A memetic algorithm for the minimum sum coloring problem
- Reinforcement learning based tabu search for the minimum load coloring problem
- A systematic study on meta-heuristic approaches for solving the graph coloring problem
- Memetic search for the max-bisection problem
- Quantum annealing of the graph coloring problem
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- A memetic algorithm with adaptive operator selection for graph coloring
- Title not available (Why is that?)
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Safe lower bounds for graph coloring
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- A hybrid metaheuristic method for the maximum diversity problem
- An effective heuristic algorithm for sum coloring of graphs
- Coloring large graphs based on independent set extraction
- Informed reactive tabu search for graph coloring
- A multi-parent genetic algorithm for the quadratic assignment problem
Uses Software
This page was built for publication: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976050)
