Solving graph coloring problems with the Douglas-Rachford algorithm
From MaRDI portal
Publication:1653324
DOI10.1007/s11228-017-0461-4OpenAlexW2781571271MaRDI QIDQ1653324
Rubén Campoy, Francisco J. Aragón Artacho
Publication date: 3 August 2018
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.05026
Iterative procedures involving nonlinear operators (47J25) Combinatorial optimization (90C27) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items (8)
Circumcentering reflection methods for nonconvex feasibility problems ⋮ Applying iterated mapping to the no-three-in-a-line problem ⋮ An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ A feasibility approach for constructing combinatorial designs of circulant type ⋮ General splitting methods with linearization for the split feasibility problem ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- Applications of convex analysis within mathematics
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- The Douglas-Rachford algorithm for the case of the sphere and the line
- A survey of known results and research areas for \(n\)-queens
- Some simplified NP-complete graph problems
- On the Douglas-Rachford algorithm
- Global convergence of a non-convex Douglas-Rachford iteration
- On the local convergence of the Douglas-Rachford algorithm
- Linear convergence of the Douglas–Rachford method for two closed sets
- DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
- Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
- A survey of graph coloring - its types, methods and applications
- On Weak Convergence of the Douglas–Rachford Method
- Decomposition through formalization in a product space
- A graph coloring algorithm for large scheduling problems
- An application of graph coloring to printed circuit testing
- Searching with iterated maps
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Benchmarking optimization software with performance profiles.
This page was built for publication: Solving graph coloring problems with the Douglas-Rachford algorithm
