二进制数
二次方程
算法
二次无约束二元优化
计算机科学
二次规划
数学
人工智能
数学优化
算术
物理
几何学
量子力学
量子计算机
量子
标识
DOI:10.1109/tetci.2024.3405370
摘要
Quadratic unconstrained binary optimization (QUBO) is a typical combinatorial optimization problem with widespread applications in science, engineering, and business. As QUBO problems are usually NP-hard, conventional QUBO algorithms are very time-consuming for solving large-scale QUBO problems. In this paper, we present a collaborative neurodynamic optimization algorithm for QUBO. In the proposed algorithm, multiple discrete Hopfield networks, Boltzmann machines, or their variants are employed for scattered searches, and a particle swarm optimization rule is used to re-initialize neuronal states repeatedly toward global optima. With extensive experimental results on four classic combinatorial optimization problems, we demonstrate the efficacy and potency of the algorithm against several prevailing exact and meta-heuristic algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI