A wide-ranging computational comparison of high-performance graph colouring algorithms
DOI10.1016/j.cor.2011.08.010zbMath1250.05109OpenAlexW2008645394MaRDI QIDQ1761113
Rhydian Lewis, Christine L. Mumford, Jonathan M. Thompson, Jonathan Gillard
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/11330/1/LewisWide-RangingComputational2012.pdf
Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- Some experiments with simulated annealing for coloring graphs
- On the application of graph colouring techniques in round-robin sports scheduling
- A simulated annealing approach to the traveling tournament problem
- Variable space search for graph coloring
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- A memetic algorithm for graph coloring
- Worst case analysis of a graph coloring algorithm
- Some models of graphs for scheduling sports competitions
- Graph coloring with adaptive evolutionary algorithms
- Metaheuristics for high school timetabling
- A variable neighborhood search for graph coloring.
- Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
- Future paths for integer programming and links to artificial intelligence
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- On edge orienting methods for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- An adaptive memory algorithm for the \(k\)-coloring problem
- An improved ant colony optimisation heuristic for graph colouring
- A survey of metaheuristic-based techniques for university timetabling problems
- A survey of local search methods for graph coloring
- Scheduling fixtures for basketball New Zealand
- Using an Incomplete Version of Dynamic Backtracking for Graph Colouring
- A Metaheuristic Approach for the Vertex Coloring Problem
- Reducibility Among Combinatorial Problems
- One-factorizations of the complete graph—A survey
- Almost all k-colorable graphs are easy to color
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- An application of graph coloring to printed circuit testing
- New methods to color the vertices of a graph
- Ants can colour graphs
- A Column Generation Approach for Graph Coloring
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Chromatic Scheduling and the Chromatic Number Problem
- 25 pretty graph colouring problems
- A study of permutation operators for minimum span frequency assignment using an order based representation
- A GRASP for coloring sparse graphs
This page was built for publication: A wide-ranging computational comparison of high-performance graph colouring algorithms
