Hybrid evolutionary algorithm for the b-chromatic number
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 976350 (Why is no real title available?)
- scientific article; zbMATH DE number 1953103 (Why is no real title available?)
- scientific article; zbMATH DE number 1919512 (Why is no real title available?)
- scientific article; zbMATH DE number 795588 (Why is no real title available?)
- scientific article; zbMATH DE number 3240118 (Why is no real title available?)
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- scientific article; zbMATH DE number 956855 (Why is no real title available?)
- A graph coloring algorithm for large scheduling problems
- 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 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
- Bounds for the b-chromatic number of G-v
- Bounds for the b-chromatic number of some families of graphs
- Chromatic Scheduling and the Chromatic Number Problem
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Exact values for theb-chromatic number of a power completek-ary tree
- Exploration and exploitation in evolutionary algorithms: a survey
- Fast generation of regular graphs and construction of cages
- Future paths for integer programming and links to artificial intelligence
- Genetic and hybrid algorithms for graph coloring
- Graph Colorings
- Graph theory
- Hybrid evolutionary algorithms for graph coloring
- Introduction to evolutionary computing
- New methods to color the vertices of a graph
- On approximating the b-chromatic number
- On the \(b\)-chromatic number of regular graphs
- On the \(b\)-continuity property of graphs
- On the \(b\)-dominating coloring of graphs
- On the b-chromatic number of some graph products
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Some bounds for the \(b\)-chromatic number of a generalized Hamming graph
- Some bounds for the b-chromatic number of a graph
- Some experiments with simulated annealing for coloring graphs
- The \(b\)-chromatic index of a graph
- The b -chromatic number of the cartesian product of two graphs
- The b-chromatic number of a graph
- The b-chromatic number of cubic graphs
- The b-chromatic number of power graphs of complete caterpillars
- Using tabu search techniques for graph coloring
- Variable space search for graph coloring
Cited in
(5)- The \(b\)-chromatic number and related topics -- a survey
- An integer programming approach to b-coloring
- A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
- The \(b\)-chromatic index of direct product of graphs
- Upper and lower bounds based on linear programming for the b-coloring problem
This page was built for publication: Hybrid evolutionary algorithm for the b-chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q525060)
