An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm.
Francisco J. Aragón ArtachoRubén CampoyVeit ElserPublished in: J. Glob. Optim. (2020)
Keyphrases
- times faster
- learning algorithm
- matching algorithm
- preprocessing
- detection algorithm
- knowledge base
- optimal solution
- computational complexity
- clustering method
- neural network
- experimental evaluation
- optimization algorithm
- high accuracy
- dynamic programming
- np hard
- objective function
- computational cost
- worst case
- simulated annealing
- expectation maximization
- significant improvement
- k means
- lower bound
- data structure
- combinatorial optimization
- semidefinite programming