A hybrid algorithm of simulated annealing and tabu search for graph colouring problem

DOI10.1504/IJOR.2011.040694zbMATH Open1234.05101OpenAlexW2039026643MaRDI QIDQ659448

Ali Pahlavani, Kourosh Eshghi

Publication date: 18 January 2012

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2011.040694

zbMATH Keywords

simulated annealingtabu searchgraph colouringhybrid metaheuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

A systematic study on meta-heuristic approaches for solving the graph coloring problem

Uses Software

• DIMACS

This page was built for publication: A hybrid algorithm of simulated annealing and tabu search for graph colouring problem