Tabu search for the BWC problem

Daniel Berend; Ephraim Korach; Shira Zucker

doi:10.1007/s10898-011-9783-1

Tabu search for the BWC problem

Daniel Berend, Ephraim Korach, Shira Zucker

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

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 language	English
Pages (from-to)	649-667
Number of pages	19
Journal	Journal of Global Optimization
Volume	54
Issue number	4
DOIs	https://doi.org/10.1007/s10898-011-9783-1
State	Published - 1 Dec 2012

Keywords

Anticoloring
BWC problem
Heuristic
Tabu search

ASJC Scopus subject areas

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

Access to Document

10.1007/s10898-011-9783-1

Cite this

@article{ae5e99e4a66c4ed38227c4b647229892,

title = "Tabu search for the BWC problem",

abstract = "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.",

keywords = "Anticoloring, BWC problem, Heuristic, Tabu search",

author = "Daniel Berend and Ephraim Korach and Shira Zucker",

year = "2012",

month = dec,

day = "1",

doi = "10.1007/s10898-011-9783-1",

language = "English",

volume = "54",

pages = "649--667",

journal = "Journal of Global Optimization",

issn = "0925-5001",

publisher = "Springer Netherlands",

number = "4",

}

TY - JOUR

T1 - Tabu search for the BWC problem

AU - Berend, Daniel

AU - Korach, Ephraim

AU - Zucker, Shira

PY - 2012/12/1

Y1 - 2012/12/1

N2 - 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.

AB - 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.

KW - Anticoloring

KW - BWC problem

KW - Heuristic

KW - Tabu search

UR - http://www.scopus.com/inward/record.url?scp=84869488987&partnerID=8YFLogxK

U2 - 10.1007/s10898-011-9783-1

DO - 10.1007/s10898-011-9783-1

M3 - Article

AN - SCOPUS:84869488987

VL - 54

SP - 649

EP - 667

JO - Journal of Global Optimization

JF - Journal of Global Optimization

SN - 0925-5001

IS - 4

ER -

Tabu search for the BWC problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this