Analysis of a parallel MCMC algorithm for graph coloring with nearly uniform balancing.
Donatello ConteGiuliano GrossiRaffaella LanzarottiJianyi LinAlessandro PetriniPublished in: Pattern Recognit. Lett. (2021)
Keyphrases
- graph coloring
- optimal solution
- computational complexity
- learning algorithm
- hamiltonian cycle
- linear programming
- cost function
- dynamic programming
- simulated annealing
- optimization algorithm
- search strategy
- state space
- computational intelligence
- search algorithm
- knapsack problem
- benchmark problems
- markov chain monte carlo
- objective function
- neural network