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

Francisco J. Aragón Artacho, Rubén Campoy, Veit Elser

Type: Preprint

Publication Date: 2018-01-01

Citations: 4

DOI: https://doi.org/10.48550/arxiv.1808.01022

View Publication

Locations

arXiv (Cornell University) - View
RUA, Repositorio Institucional de la Universidad de Alicante (Universidad de Alicante) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm	2020	Francisco J. Aragón Artacho Rubén Campoy Veit Elser
+	Solving graph coloring problems with the Douglas-Rachford algorithm	2016	Francisco J. Aragón Artacho Rubén Campoy
+	Solving graph coloring problems with the Douglas-Rachford algorithm	2016	Francisco J. Aragón Artacho Rubén Campoy
+ PDF Chat	Solving Graph Coloring Problems with the Douglas-Rachford Algorithm	2018	Francisco J. Aragón Artacho Rubén Campoy
+	New heuristics for the vertex coloring problem based on semidefinite programming	2012	Jelena Govorčin Nebojša Gvozdenović Janez Povh
+ PDF Chat	The Douglas–Rachford algorithm for convex and nonconvex feasibility problems	2019	Francisco J. Aragón Artacho Rubén Campoy Matthew K. Tam
+	Douglas–Rachford splitting method for semidefinite programming	2015	Yunda Dong
+	Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems	2021	Federico Battista Marianna De Santis
+ PDF Chat	An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem	2005	Gary Kochenberger Fred Glover Bahram Alidaee César Rego
+ PDF Chat	Fractional programming formulation for the vertex coloring problem	2014	Tomomi Matsui Noriyoshi Sukegawa Atsushi Miyauchi
+	Improved semidefinite branch-and-bound algorithm for k-cluster	2012	Nathan Krislock Jérôme Malick Frédéric Roupin
+	Graph Coloring and Semidefinite Rank	2022	Renee Mirka Devin Smedira David P. Williamson
+	Semidefinite programming relaxations for graph coloring and maximal clique problems	2006	Igor Dukanovic Franz Rendl
+	Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems	2024	Federico Battista Marianna De Santis
+	Semidefinite programs and association schemes	1999	Michel X. Goemans Franz Rendl
+	Recent Results on Douglas–Rachford Methods	2013	Francisco J. Aragón Artacho Jonathan M. Borwein Matthew K. Tam
+	Finding magic squares with the Douglas-Rachford algorithm	2019	Francisco J. Aragón Artacho Paula Segura Martínez
+ PDF Chat	Computational results of a semidefinite branch-and-bound algorithm for k-cluster	2015	Nathan Krislock Jérôme Malick Frédéric Roupin
+	On the generalized Douglas-Rachford algorithm for feasibility problems	2017	Minh N. Dao Hung M. Phan
+	Semidefinite Programming and Combinatorial Optimization	2024	Adam N. Letchford

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD	2020	Scott B. Lindstrom Brailey Sims

Works Cited by This (0)

Action	Title	Year	Authors