Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Heuristics

Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

Endre Boros, Peter L. Hammer, Gabriel Tavares

Published Feb 20, 2007• 142 citations
Publisher
DOI
10.1007/s10732-007-9009-3

Related papers

Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Peter Merz, Bernd Freisleben

Journal of Heuristics•Mar 1, 2002•147 citations

Quadratic Unconstrained Binary Optimization (QUBO) Modeling

WORLD SCIENTIFIC eBooks•Mar 20, 2023•2 citations

QUBO: Quadratic Unconstrained Binary Optimization Problem

Gary A. Kochenberger, Fred Glover, Haibo Wang

Springer eBooks•Dec 17, 2024•1 citation

Heuristic algorithms based on deep reinforcement learning for quadratic unconstrained binary optimization

Ming Chen, Yuning Chen, Yonghao Du +2 more

Knowledge-Based Systems•Aug 8, 2020•18 citations

A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

Endre Boros, Peter L. Hammer, Richard L. Sun +1 more

Discrete Optimization•Dec 1, 2007•50 citations

A Collaborative Neurodynamic Algorithm for Quadratic Unconstrained Binary Optimization

Hongzong Li, Jun Wang

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.

IEEE Transactions on Emerging Topics in Computational Intelligence•Jun 3, 2024•18 citations
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.