INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING
From MaRDI portal
Publication:2853412
DOI10.1142/S0217595913500103zbMath1279.90179OpenAlexW2041536578MaRDI QIDQ2853412
Jin-Kao Hao, Pascale Kuntz, Daniel Cosmin Porumbel
Publication date: 21 October 2013
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595913500103
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- Some experiments with simulated annealing for coloring graphs
- The graph coloring problem: A neuronal network approach
- Variable space search for graph coloring
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- A search space ``cartography for guiding graph coloring heuristics
- A memetic algorithm for graph coloring
- An adaptive, multiple restarts neural network algorithm for graph coloring
- A variable neighborhood search for graph coloring.
- Coloration neighbourhood search with forward checking
- Coloring large graphs based on independent set extraction
- EPCOT: An efficient procedure for coloring optimally with Tabu Search
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- An ant-based algorithm for coloring graphs
- An adaptive memory algorithm for the \(k\)-coloring problem
- An improved ant colony optimisation heuristic for graph colouring
- A survey of local search methods for graph coloring
- A Metaheuristic Approach for the Vertex Coloring Problem
- A survey on vertex coloring problems
- Ant Local Search and its efficient adaptation to graph colouring
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- The Reactive Tabu Search
- Ants can colour graphs
This page was built for publication: INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING
