Genetic and hybrid algorithms for graph coloring
From MaRDI portal
Publication:1919854
DOI10.1007/BF02125407zbMath0851.90095MaRDI QIDQ1919854
Jacques A. Ferland, Charles Fleurent
Publication date: 28 July 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)
Related Items
Hybrid evolutionary search for the minimum sum coloring problem of graphs, A review on algorithms for maximum clique problems, A variable neighborhood search method for solving the traveling tournaments problem, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, The dynamic frequency assignment problem, Iterative coloring extension of a maximum clique, Coloration de graphes : fondements et applications, Computing the metric dimension of graphs by genetic algorithms, Simple decentralized graph coloring, Metaheuristics: A bibliography, Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, Exploring the role of graph spectra in graph coloring algorithm performance, Genetic tabu search for robust fixed channel assignment under dynamic traffic data, Heuristics for a project management problem with incompatibility and assignment costs, A variable neighborhood search for graph coloring., A new ant colony optimization algorithm for the lower bound of sum coloring problem, Decomposition of realizable fuzzy relations, Combining metaheuristics with mathematical programming, constraint programming and machine learning, A Birnbaum-importance based genetic local search algorithm for component assignment problems, A cooperative search method for the \(k\)-coloring problem, The general \(\alpha \)-decomposition problem of fuzzy relations, A graph coloring heuristic using partial solutions and a reactive tabu scheme, CHECKCOL: improved local search for graph coloring, A semidefinite programming-based heuristic for graph coloring, An ant-based algorithm for coloring graphs, Coloring graphs by iterated local search traversing feasible and infeasible solutions, Efficient algorithms for finding critical subgraphs, An adaptive memory algorithm for the \(k\)-coloring problem, Tabu search for covering arrays using permutation vectors, An improved ant colony optimisation heuristic for graph colouring, Variable space search for graph coloring, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Hybrid evolutionary algorithm for the b-chromatic number, Programming for modular reconfigurable robots, A wide-ranging computational comparison of high-performance graph colouring algorithms, Embedding a novel objective function in a two-phased local search for robust vertex coloring, Efficient solutions for the far from most string problem, Coloring large graphs based on independent set extraction, A survey of local search methods for graph coloring, Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite, Improving the extraction and expansion method for large graph coloring, A NEW APPROACH TO THE VERTEX COLORING PROBLEM, Adaptive memory programming: a unified view of metaheuristics, Computing minimal doubly resolving sets of graphs, Consistency checking within local search applied to the frequency assignment with polarization problem, Combinatorial optimization in system configuration design, What is my objective function?, Graph coloring by multiagent fusion search, A search space ``cartography for guiding graph coloring heuristics, On a parallel genetic-tabu search based algorithm for solving the graph colouring problem, A memetic algorithm for graph coloring, A framework for the description of evolutionary algorithms, INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING, The resolution complexity of random graph \(k\)-colorability, AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING, A tabu search approach to the constraint satisfaction problem as a general problem solver
Uses Software
Cites Work
- Using tabu search techniques for graph coloring
- Some experiments with simulated annealing for coloring graphs
- Evolution algorithms in combinatorial optimization
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- A genetic approach to the quadratic assignment problem
- Future paths for integer programming and links to artificial intelligence
- Dynamic tabu list management using the reverse elimination method
- 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
- The Reactive Tabu Search
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
