Results (1)
Search Parameters:
Author/Affiliation: Lixin TaoOpen AccessArticle
16 Pages, 1,387 KB 
Parallelizing Combinatorial Optimization Heuristics with GPUs
Abstract:
Combinatorial optimization problems are often NP-hard and too complex to be solved within a reasonable time frame by exact methods. Heuristic methods which do not offer a convergence guarantee could obtain some satisfactory resolution for combinatorial optimization problems. However, it is not only very time consuming for Central Processing Units (CPU) but also very difficult…
Read More(This article belongs to the Special Issue on Multidisciplinary Sciences and Engineering 2018 & Section Artificial Intelligence in Computer Science (CAI))