Circular coloring of graphs via linear programming and tabu search

Mate Barany, Z. Tuza

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Circular coloring is a popular branch of graph theory which has been exhaustively studied for two decades mainly from a theoretical perspective. Since it is a refinement of the traditional proper coloring, it provides a more accurate model for cyclic scheduling problems which often arise in industrial applications. The present paper briefly surveys a special class of open shop scheduling that can be solved via circular coloring, and then proposes a new mathematical programming model and tabu search algorithm to compute the circular chromatic number of a graph effectively.

Original languageEnglish
Pages (from-to)833-848
Number of pages16
JournalCentral European Journal of Operations Research
Volume23
Issue number4
DOIs
Publication statusPublished - Dec 1 2015

Fingerprint

Linear programming
Graph
Tabu search
Graph theory
Cyclic scheduling
Mathematical programming

Keywords

  • Circular graph coloring
  • Cyclic scheduling
  • Linear programming
  • Parallel computing
  • Tabu search

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

Circular coloring of graphs via linear programming and tabu search. / Barany, Mate; Tuza, Z.

In: Central European Journal of Operations Research, Vol. 23, No. 4, 01.12.2015, p. 833-848.

Research output: Contribution to journalArticle

@article{9b84894975fb40649c5089bce6e44adb,
title = "Circular coloring of graphs via linear programming and tabu search",
abstract = "Circular coloring is a popular branch of graph theory which has been exhaustively studied for two decades mainly from a theoretical perspective. Since it is a refinement of the traditional proper coloring, it provides a more accurate model for cyclic scheduling problems which often arise in industrial applications. The present paper briefly surveys a special class of open shop scheduling that can be solved via circular coloring, and then proposes a new mathematical programming model and tabu search algorithm to compute the circular chromatic number of a graph effectively.",
keywords = "Circular graph coloring, Cyclic scheduling, Linear programming, Parallel computing, Tabu search",
author = "Mate Barany and Z. Tuza",
year = "2015",
month = "12",
day = "1",
doi = "10.1007/s10100-014-0345-8",
language = "English",
volume = "23",
pages = "833--848",
journal = "Central European Journal of Operations Research",
issn = "1435-246X",
publisher = "Physica-Verlag",
number = "4",

}

TY - JOUR

T1 - Circular coloring of graphs via linear programming and tabu search

AU - Barany, Mate

AU - Tuza, Z.

PY - 2015/12/1

Y1 - 2015/12/1

N2 - Circular coloring is a popular branch of graph theory which has been exhaustively studied for two decades mainly from a theoretical perspective. Since it is a refinement of the traditional proper coloring, it provides a more accurate model for cyclic scheduling problems which often arise in industrial applications. The present paper briefly surveys a special class of open shop scheduling that can be solved via circular coloring, and then proposes a new mathematical programming model and tabu search algorithm to compute the circular chromatic number of a graph effectively.

AB - Circular coloring is a popular branch of graph theory which has been exhaustively studied for two decades mainly from a theoretical perspective. Since it is a refinement of the traditional proper coloring, it provides a more accurate model for cyclic scheduling problems which often arise in industrial applications. The present paper briefly surveys a special class of open shop scheduling that can be solved via circular coloring, and then proposes a new mathematical programming model and tabu search algorithm to compute the circular chromatic number of a graph effectively.

KW - Circular graph coloring

KW - Cyclic scheduling

KW - Linear programming

KW - Parallel computing

KW - Tabu search

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

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

U2 - 10.1007/s10100-014-0345-8

DO - 10.1007/s10100-014-0345-8

M3 - Article

VL - 23

SP - 833

EP - 848

JO - Central European Journal of Operations Research

JF - Central European Journal of Operations Research

SN - 1435-246X

IS - 4

ER -