Multistart iterated tabu search for bandwidth coloring problem

DOI10.1016/J.COR.2012.09.003zbMath1352.90084OpenAlexW1981528969MaRDI QIDQ502459

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

metaheuristicsfrequency assignmentperturbation operatoriterated tabu searchbandwidth coloringbandwidth multicoloring

Mathematics Subject Classification ID

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

Related Items (3)

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

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