An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm

We study the behavior of the Douglas–Rachford algorithm on the graph vertex-coloring problem. Given a graph and a number of colors, the goal is to find a coloring of the vertices so that all adjacent vertex pairs have different colors. In spite of the combinatorial nature of this problem, the Dougla...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of global optimization 2020-06, Vol.77 (2), p.383-403
Hauptverfasser:	Aragón Artacho, Francisco J., Campoy, Rubén, Elser, Veit
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Combinatorial analysis Computer Science Graph coloring Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Real Functions Semidefinite programming
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!