Algoritmo de búsqueda tabú para una variante del problema de coloración

DOI10.15517/RMTA.V20I2.11661MaRDI QIDQ5262602zbMATHOpenAlexFDO

Authors Mario Aboytes-Ojeda, Ana Lilia Laureano-Cruces, Javier Ramírez-Rodríguez

Publication date 16 July 2015

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.v20i2.11661

zbMATH Keywords

heuristicstimetabling problemsrobust coloring

Mathematics Subject Classification ID

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

Recommendations

• Using tabu search techniques for graph coloring
• A tabu search approach for the sum coloring problem
• scientific article; zbMATH DE number 597813
• Tabu search with simple ejection chains for coloring graphs
• A tabu search heuristic for the equitable coloring problem
• scientific article; zbMATH DE number 1488073
• scientific article; zbMATH DE number 956852

Cited in

(4)

• EPCOT: An efficient procedure for coloring optimally with Tabu Search
• Reinforcement learning based tabu search for the minimum load coloring problem
• Tabu search with simple ejection chains for coloring graphs
• scientific article; zbMATH DE number 1488073 (Why is no real title available?)

This page was built for publication: Algoritmo de búsqueda tabú para una variante del problema de coloración

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