A hybrid algorithm for the robust graph coloring problem

DOI10.15517/RMTA.V23I2.25269zbMATH Open1352.05177OpenAlexW2507401231MaRDI QIDQ3178960FDOQ3178960

Authors Roman Anselmo Mora-Gutiérrez, Javier Ramírez-Rodríguez, Eric Alfredo Rincón-García, Antonin Ponsich, Ana Lilia Laureano-Cruces

Publication date 20 December 2016

Published in Revista de Matemática: Teoría y Aplicaciones (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15517/rmta.v23i2.25269

zbMATH Keywords

combinatorial optimizationmetaheuristicsinteger programming

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• AI 2003: Advances in Artificial Intelligence
• A branch-and-price algorithm for the robust graph coloring problem
• The robust coloring problem.
• An application of a new hybrid genetic algorithm to graph coloring
• New algorithm for the sum coloring problem

Cited in

(8)

• Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling
• Heuristics for the robust coloring problem
• Solving graph coloring problems with the Douglas-Rachford algorithm
• A branch-and-price algorithm for the robust graph coloring problem
• An application of a new hybrid genetic algorithm to graph coloring
• Graph \(k\)-colorability using a threshold accepting and Davis-Putnam hybrid algorithm
• The robust coloring problem.
• AI 2003: Advances in Artificial Intelligence

This page was built for publication: A hybrid algorithm for the robust graph coloring problem

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