Berend, Daniel; Korach, Ephraim; Zucker, Shira - In: Journal of Global Optimization 54 (2012) 4, pp. 649-667
Given a graph G and positive integers B and W, the BWC problem asks about the existence of a coloring of G, with B black and W white vertices, such that there is no edge between a black and a white vertex. We suggest a heuristic, based on tabu search, which yields quite good results for this...