An adaptive memory algorithm for the k-coloring problem
From MaRDI portal
Publication:2467362
DOI10.1016/J.DAM.2006.07.017zbMATH Open1131.05089OpenAlexW2092998591MaRDI QIDQ2467362FDOQ2467362
Alain Hertz, Nicolas Zufferey, P. Galinier
Publication date: 21 January 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.07.017
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of local search methods for graph coloring
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- Hybrid evolutionary algorithms for graph coloring
- Using tabu search techniques for graph coloring
- Probabilistic diversification and intensification in local search for vehicle routing
- Chromatic Scheduling and the Chromatic Number Problem
- A framework for the description of evolutionary algorithms
- Genetic and hybrid algorithms for graph coloring
- Some experiments with simulated annealing for coloring graphs
- A taxonomy of evolutionary algorithms in combinatorial optimization
Cited In (32)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM
- Consistent neighborhood search for combinatorial optimization
- An extraction and expansion approach for graph coloring
- Graph Coloring Models and Metaheuristics for Packing Applications
- Heuristics for a project management problem with incompatibility and assignment costs
- An exact approach for the vertex coloring problem
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
- Improving the extraction and expansion method for large graph coloring
- CsegGraph: a graph colouring instance generator
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- Meta-heuristics and artificial intelligence
- A search space ``cartography for guiding graph coloring heuristics
- A branch-and-price algorithm for the robust graph coloring problem
- Metaheuristics for truck loading in the car production industry
- A parallel adaptive memory algorithm for the capacitated modular hub location problem
- Graph coloring by multiagent fusion search
- A survey of local search methods for graph coloring
- A memetic algorithm for graph coloring
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
- An exact algorithm with learning for the graph coloring problem
- Quantum annealing of the graph coloring problem
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Variable space search for graph coloring
- Graph colouring approaches for a satellite range scheduling problem
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- A cooperative search method for the \(k\)-coloring problem
- A survey on vertex coloring problems
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Efficient algorithms for finding critical subgraphs
- Coloring large graphs based on independent set extraction
- Informed reactive tabu search for graph coloring
- Hybrid evolutionary algorithm for the b-chromatic number
Uses Software
Recommendations
This page was built for publication: An adaptive memory algorithm for the \(k\)-coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467362)
