A Large Neighborhood Search Heuristic for Graph Coloring
From MaRDI portal
Publication:3612429
DOI10.1007/978-3-540-72397-4_25zbMath1214.68375OpenAlexW1690404861MaRDI QIDQ3612429
Michael A. Trick, Hakan Yildiz
Publication date: 10 March 2009
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72397-4_25
Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems ⋮ An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring ⋮ Graph coloring by multiagent fusion search ⋮ A search space ``cartography for guiding graph coloring heuristics
Uses Software
This page was built for publication: A Large Neighborhood Search Heuristic for Graph Coloring
