Title : ( Two integer formulations for interval coloring of weighted graphs )
Authors: Reza Ghanbari , ٍEffat sadat Alavi ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
The interval coloring of weighted graph is a general form of the classical graph coloring problem. This problem arises from many situations in the real word problems especially in the scheduling problems. Here, two integer formulations are given. In the first proposed formulation, we use an idea based on the formulation of the classical control project problem. In the second formulation, we try to insert the clique constraints to the model.
Keywords
, Graph coloring, Weighted graphs, Integer formulation, Clique
@inproceedings{paperid:1045989,
author = {Ghanbari, Reza and ٍEffat Sadat Alavi},
title = {Two integer formulations for interval coloring of weighted graphs},
booktitle = {6th International Conference of Iranian Operations research society},
year = {2014},
location = {IRAN},
keywords = {Graph coloring; Weighted graphs; Integer formulation; Clique},
}
%0 Conference Proceedings
%T Two integer formulations for interval coloring of weighted graphs
%A Ghanbari, Reza
%A ٍEffat Sadat Alavi
%J 6th International Conference of Iranian Operations research society
%D 2014
