Tabu search with simple ejection chains for coloring graphs
From MaRDI portal
Publication:1861926
DOI10.1023/A:1021573507189zbMath1028.90073MaRDI QIDQ1861926
Manuel Laguna, José Luis González-Velarde
Publication date: 10 March 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021573507189
90C35: Programming involving graphs or networks
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem, Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem, A new approach for scheduling independent tasks with multiple modes, Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems