Tabu search for the BWC problem

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


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 problem. We compare the performance of our algorithm to that of several other known heuristics, and also to what one might expect based on some theoretical results we obtained for the checked graphs.

Original languageEnglish
Pages (from-to)649-667
Number of pages19
JournalJournal of Global Optimization
Issue number4
StatePublished - 1 Dec 2012


  • Anticoloring
  • BWC problem
  • Heuristic
  • Tabu search

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics


Dive into the research topics of 'Tabu search for the BWC problem'. Together they form a unique fingerprint.

Cite this