Heuristics for the bandwidth colouring problem

DOI10.1504/IJMHEUR.2010.033121MaRDI QIDQ537987zbMATH OpenFDO

Authors Rafael Martí, Francisco Gortazar, Abraham Duarte

Publication date 23 May 2011

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

zbMATH Keywords

tabu searchgraph colouringGRASPgreedy randomised adaptive search procedures

Mathematics Subject Classification ID

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

Recommendations

• An evolutionary approach for bandwidth multicoloring problems
• Publication:5752591
• On the use of some known methods for \(T\)-colorings of graphs
• scientific article; zbMATH DE number 597813
• A GRASP for coloring sparse graphs

Cited in

(8)

• Two genetic algorithms for the bandwidth multicoloring problem
• Level-based heuristics and hill climbing for the antibandwidth maximization problem
• Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem
• Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
• A black-box scatter search for optimization problems with integer variables
• Tabu search for the BWC problem
• Multistart iterated tabu search for bandwidth coloring problem
• An evolutionary approach for bandwidth multicoloring problems

Describes a project that uses

Uses Software

• CALMA

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537987)