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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 291; H. 1; S. 67 - 83
Hauptverfasser:	Şeker, Oylum, Ekim, Tınaz, Taşkın, Z. Caner
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 16.05.2021
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!