An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
From MaRDI portal
Publication:976050
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
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 558543 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1488073 (Why is no real title available?)
- scientific article; zbMATH DE number 2086445 (Why is no real title available?)
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- scientific article; zbMATH DE number 956854 (Why is no real title available?)
- scientific article; zbMATH DE number 956867 (Why is no real title available?)
- A Large Neighborhood Search Heuristic for Graph Coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A memetic algorithm for graph coloring
- A metaheuristic approach for the vertex coloring problem
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
- A search space ``cartography for guiding graph coloring heuristics
- A survey of local search methods for graph coloring
- A survey on vertex coloring problems
- A variable neighborhood search for graph coloring.
- An adaptive memory algorithm for the \(k\)-coloring problem
- An algorithm for the chromatic number of a graph
- An evolutionary approach for bandwidth multicoloring problems
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Feature Article—Genetic Algorithms for the Operations Researcher
- Hybrid evolutionary algorithms for graph coloring
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Partition-distance: A problem and class of perfect graphs arising in clustering
- Some experiments with simulated annealing for coloring graphs
- The algebra of genetic algorithms
- Using tabu search techniques for graph coloring
- Variable space search for graph coloring
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
Cited in
(22)- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- A hybrid metaheuristic method for the maximum diversity problem
- An extraction and expansion approach for graph coloring
- An effective heuristic algorithm for sum coloring of graphs
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
- Coloring large graphs based on independent set extraction
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
- Meta-heuristics and artificial intelligence
- A multi-parent genetic algorithm for the quadratic assignment problem
- Safe lower bounds for graph coloring
- Quantum annealing of the graph coloring problem
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- A systematic study on meta-heuristic approaches for solving the graph coloring problem
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- Improving the extraction and expansion method for large graph coloring
- A memetic algorithm with adaptive operator selection for graph coloring
- scientific article; zbMATH DE number 1342294 (Why is no real title available?)
- A memetic algorithm for the minimum sum coloring problem
- Memetic search for the max-bisection problem
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Reinforcement learning based tabu search for the minimum load coloring problem
- Informed reactive tabu search for graph coloring
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)
