Multistart iterated tabu search for bandwidth coloring problem

DOI10.1016/J.COR.2012.09.003MaRDI QIDQ502459zbMATH OpenOpenAlexFDO

Authors Xiangjing Lai, Zhipeng Lü

Publication date 5 January 2017

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2012.09.003

zbMATH Keywords

bandwidth coloringbandwidth multicoloringfrequency assignmentiterated tabu searchmetaheuristicsperturbation operator

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1488073
• Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem
• Heuristics for the bandwidth colouring problem
• An evolutionary approach for bandwidth multicoloring problems
• Iterated local search with tabu search for the weighted vertex coloring problem

Cited in

(4)

• Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model
• On distance graph coloring problems
• The road train optimization problem with load assignment
• Integrated optimization of pilot and pilot carrier routing in seaports

This page was built for publication: Multistart iterated tabu search for bandwidth coloring problem

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