A GRASP for coloring sparse graphs

DOI10.1023/A:1011237503342zbMath1168.90631OpenAlexW1785083131MaRDI QIDQ5938473

Manuel Laguna, Rafael Martí

Publication date: 22 July 2001

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011237503342

zbMATH Keywords

metaheuristicsGRASPgraph coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

A grasp-knapsack hybrid for a nurse-scheduling problem, A combinatorial algorithm for the TDMA message scheduling problem, Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks, A nonmonotone GRASP, Population-based iterated greedy algorithm for the S-labeling problem, A graph coloring heuristic using partial solutions and a reactive tabu scheme, An improved ant colony optimisation heuristic for graph colouring, A wide-ranging computational comparison of high-performance graph colouring algorithms, Coloring large graphs based on independent set extraction, On the recursive largest first algorithm for graph colouring, On a parallel genetic-tabu search based algorithm for solving the graph colouring problem, A memetic algorithm for graph coloring