Pages that link to "Item:Q1653324"
From MaRDI portal
The following pages link to Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324):
Displaying 8 items.
- A feasibility approach for constructing combinatorial designs of circulant type (Q1752612) (← links)
- General splitting methods with linearization for the split feasibility problem (Q2022289) (← links)
- Circumcentering reflection methods for nonconvex feasibility problems (Q2158827) (← links)
- Applying iterated mapping to the no-three-in-a-line problem (Q2163429) (← links)
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284) (← links)
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471) (← links)
- APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS (Q3122033) (← links)
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD (Q4992365) (← links)
