Tabu search with simple ejection chains for coloring graphs
From MaRDI portal
Publication:1861926
DOI10.1023/A:1021573507189zbMath1028.90073OpenAlexW132622530MaRDI 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
Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
A new approach for scheduling independent tasks with multiple modes ⋮ Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem ⋮ Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling ⋮ Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems ⋮ Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem
This page was built for publication: Tabu search with simple ejection chains for coloring graphs
