Graph k-colorability using a threshold accepting and Davis-Putnam hybrid algorithm

zbMATH Open1185.68349MaRDI QIDQ3556771FDOQ3556771

Authors: Juan Frausto-Solís, Héctor Sanvicente-Sánchez, Marco Antonio Cruz-Chávez, Mónica Larre Bolaños-Cacho, José Crispin Zavala-Díaz, Humberto Ayanegui 

Publication date: 26 April 2010

Recommendations

• A hybrid algorithm of simulated annealing and tabu search for graph colouring problem
• A hybrid algorithm for the robust graph coloring problem
• An application of a new hybrid genetic algorithm to graph coloring
• An adaptive memory algorithm for the \(k\)-coloring problem
• A Pruning Procedure for Exact Graph Coloring

zbMATH Keywords

simulated annealingcombinatorial optimizationchromatic numbergraph coloringthreshold acceptingDavis \& Putnam

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Graph \(k\)-colorability using a threshold accepting and Davis-Putnam hybrid algorithm

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