Pages that link to "Item:Q2176284"
From MaRDI portal
The following pages link to An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284):
Displaying 5 items.
- General splitting methods with linearization for the split feasibility problem (Q2022289) (← links)
- An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
- Circumcentering reflection methods for nonconvex feasibility problems (Q2158827) (← links)
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471) (← links)
- Douglas–Rachford algorithm for control-constrained minimum-energy control problems (Q6151944) (← links)
