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

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 291; číslo 1; s. 67 - 83
Hlavní autori:	Şeker, Oylum, Ekim, Tınaz, Taşkın, Z. Caner
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.05.2021
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!