2021
DOI: 10.48550/arxiv.2102.09696
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A matheuristic approach for the $b$-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic

Rafael A. Melo,
Michell F. Queiroz,
Marcio C. Santos

Abstract: Given a graph G = (V, E), the b-coloring problem consists in attributing a color to every vertex in V such that adjacent vertices receive different colors, every color has a b-vertex, and the number of colors is maximized. A b-vertex is a vertex adjacent to vertices colored with all used colors but its own. The b-coloring problem is known to be NP-Hard and its optimal solution determines the b-chromatic number of G, denoted χ b (G). This paper presents an integer programming formulation and a very effective mu… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 25 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?