Hybrid evolutionary algorithm for the b-chromatic number
DOI10.1007/S10732-015-9288-ZzbMATH Open1360.90302OpenAlexW2021773268MaRDI QIDQ525060FDOQ525060
Authors: Iztok Peterin, Marjan Mernik, Matej Črepinšek, Iztok Fister 
Publication date: 28 April 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-015-9288-z
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph theory
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Fast generation of regular graphs and construction of cages
- Introduction to evolutionary computing
- Future paths for integer programming and links to artificial intelligence
- A survey of local search methods for graph coloring
- Title not available (Why is that?)
- The b-chromatic number of a graph
- On the \(b\)-chromatic number of regular graphs
- On the \(b\)-continuity property of graphs
- A survey on vertex coloring problems
- Bounds for the \(b\)-chromatic number of \(G-v\)
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Colorings
- Title not available (Why is that?)
- Title not available (Why is that?)
- The b-chromatic number of cubic graphs
- Title not available (Why is that?)
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Exploration and exploitation in evolutionary algorithms: a survey
- A memetic algorithm for graph coloring
- Using tabu search techniques for graph coloring
- Some bounds for the \(b\)-chromatic number of a graph
- On the b-chromatic number of some graph products
- The b-chromatic number of power graphs of complete caterpillars
- Title not available (Why is that?)
- Variable space search for graph coloring
- On approximating the b-chromatic number
- An adaptive memory algorithm for the \(k\)-coloring problem
- Bounds for the b-chromatic number of some families of graphs
- On the \(b\)-dominating coloring of graphs
- A metaheuristic approach for the vertex coloring problem
- Chromatic Scheduling and the Chromatic Number Problem
- Title not available (Why is that?)
- A variable neighborhood search for graph coloring.
- Genetic and hybrid algorithms for graph coloring
- Exact values for theb-chromatic number of a power completek-ary tree
- The b -chromatic number of the cartesian product of two graphs
- Some bounds for the \(b\)-chromatic number of a generalized Hamming graph
- Some experiments with simulated annealing for coloring graphs
- The \(b\)-chromatic index of a graph
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
Uses Software
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)
