Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Signal Processing Systems"
DOI: 10.1007/s11265-020-01550-1
Abstract: NP-hard problems such as the maximum clique or minimum vertex cover problems, two of Karp’s 21 NP-hard problems, have several applications in computational chemistry, biochemistry and computer network security. Adiabatic quantum annealers can search for… read more here.
Keywords: algorithms solving; solving hard; hard problems; decomposition algorithms ... See more keywords
Solving NP-Hard Problems with Physarum-Based Ant Colony System
Sign Up to like & getrecommendations! Published in 2017 at "IEEE/ACM Transactions on Computational Biology and Bioinformatics"
DOI: 10.1109/tcbb.2015.2462349
Abstract: NP-hard problems exist in many real world applications. Ant colony optimization (ACO) algorithms can provide approximate solutions for those NP-hard problems, but the performance of ACO algorithms is significantly reduced due to premature convergence and… read more here.
Keywords: physarum based; solving hard; hard problems; ant colony ... See more keywords