23 citations · 58 across the 14 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.OC2016
Solving graph coloring problems with the Douglas-Rachford algorithm
Francisco J. Aragón Artacho, Rubén Campoy
We present the Douglas-Rachford algorithm as a successful heuristic for solving graph coloring problems. Given a set of colors, these type of problems consist in assigning a color…
math.OC2016★ 23 cited
A new projection method for finding the closest point in the intersection of convex sets
Francisco J. Aragón Artacho, Rubén Campoy
In this paper we present a new iterative projection method for finding the closest point in the intersection of convex sets to any arbitrary point in a Hilbert space. This method,…