GPU-based Ising computing for solving max-cut combinatorial optimization problems.
Chase CookHengyang ZhaoTakashi SatoMasayuki HiromotoSheldon X.-D. TanPublished in: Integr. (2019)
Keyphrases
- probabilistic model
- combinatorial optimization problems
- combinatorial optimization
- max cut
- np complete problems
- continuous optimization problems
- graph coloring
- job shop scheduling
- knapsack problem
- metaheuristic
- optimization problems
- traveling salesman problem
- np complete
- ant colony optimization
- phase transition
- simulated annealing
- vehicle routing problem
- job shop scheduling problem
- np hard
- branch and bound
- branch and bound algorithm
- planar graphs
- graph model
- greedy algorithm
- partition function
- spectral graph
- combinatorial problems
- image segmentation
- tabu search
- markov random field
- dynamic programming
- cost function
- optimal solution
- reinforcement learning