Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
From MaRDI portal
Publication:1922632
DOI10.1007/BF02430368zbMath0855.05063OpenAlexW2083518001MaRDI QIDQ1922632
Alain Hertz, Olivier Dubuis, Daniel Costa
Publication date: 1995
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02430368
optimization problemschromatic numbersequential methodscoloring problems\(q\)-stability numberevolutionary procedure
Related Items
A graph coloring approach to the deployment scheduling and unit assignment problem, Metaheuristics: A bibliography, A variable neighborhood search for graph coloring., An adaptive memory algorithm for the \(k\)-coloring problem, An improved ant colony optimisation heuristic for graph colouring, Coloring large graphs based on independent set extraction, A survey of local search methods for graph coloring, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, Adaptive memory programming: a unified view of metaheuristics, What is my objective function?, A framework for the description of evolutionary algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Using tabu search techniques for graph coloring
- Some experiments with simulated annealing for coloring graphs
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Simulated annealing: A tool for operational research
- Evolution algorithms in combinatorial optimization
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- An exact algorithm for the maximum stable set problem
- EPCOT: An efficient procedure for coloring optimally with Tabu Search
- Genetic algorithms: Foundations and applications
- Minimax relations for the partial q-colorings of a graph
- Polynomially solvable cases for the maximum stable set problem
- Scatter search and star-paths: Beyond the genetic metaphor
- Genetic and hybrid algorithms for graph coloring
- A user's guide to tabu search
- An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem
