An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs

•The selective graph coloring problem in perfect graphs.•An exact cutting plane algorithm.•A perfect graph generation algorithm.•An extensive computational assessment. We consider the selective graph coloring problem, which is a generalization of the classical graph coloring problem. Given a graph t...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 291; no. 1; pp. 67 - 83
Main Authors:	Şeker, Oylum, Ekim, Tınaz, Taşkın, Z. Caner
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.05.2021
Subjects:	Cutting plane algorithm Graph theory Partition coloring Perfect graph generation Selective graph coloring Perfect graph generation Graph theory Selective graph coloring Cutting plane algorithm Partition coloring
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!