Heuristics for the bandwidth colouring problem

DOI10.1504/IJMHEUR.2010.033121zbMath1221.05153MaRDI QIDQ537987

Rafael Martí, Abraham Duarte, Francisco Gortazar

Publication date: 23 May 2011

Published in: International Journal of Metaheuristics (Search for Journal in Brave)

zbMATH Keywords

tabu searchGRASPgraph colouringgreedy randomised adaptive search procedures

Mathematics Subject Classification ID

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

Related Items (2)

Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs ⋮ A black-box scatter search for optimization problems with integer variables

Uses Software

• CALMA

This page was built for publication: Heuristics for the bandwidth colouring problem