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

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

Authors: 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

Recommendations

• scientific article; zbMATH DE number 597813
• An application of a new hybrid genetic algorithm to graph coloring
• scientific article; zbMATH DE number 1488073
• Genetic and hybrid algorithms for graph coloring
• Hybrid evolutionary algorithms for graph coloring

zbMATH Keywords

simulated annealinghybrid metaheuristicstabu searchgraph colouring

Mathematics Subject Classification ID

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

Cited In (8)

• An application of a new hybrid genetic algorithm to graph coloring
• Graph \(k\)-colorability using a threshold accepting and Davis-Putnam hybrid algorithm
• Genetic and hybrid algorithms for graph coloring
• Title not available (Why is that?)
• A systematic study on meta-heuristic approaches for solving the graph coloring problem
• Title not available (Why is that?)
• On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
• Hybrid evolutionary algorithms for graph coloring

Uses Software

• DIMACS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659448)