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

Springer eBooks

The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications

Published Jan 1, 2022• 83 citations
Publisher
DOI
10.1007/978-3-031-04520-2

Related papers

QUBO: Quadratic Unconstrained Binary Optimization Problem

Gary A. Kochenberger, Fred Glover, Haibo Wang

Springer eBooks•Dec 17, 2024•1 citation

The unconstrained binary quadratic programming problem: a survey

Gary A. Kochenberger, Jin‐Kao Hao, Fred Glover +4 more

Journal of Combinatorial Optimization•Apr 17, 2014•540 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•19 citations

Binary Unconstrained Quadratic Optimization Problem

Gary A. Kochenberger, Fred Glover, Haibo Wang

Springer eBooks•Jan 1, 2013•9 citations

Direct Application of QAOA Algorithm to PUBO Problem

Junya Wang

Previously, the approach to solving the PUBO (multiple unconstrained binary optimization) was to transform it into the QUBO (Quadratic Unconstrained Binary Optimization) via variable substitution. Variable substitution is bound to introduce new variables, and when using the QAOA algorithm for solution, it also implies that inevitably more controllable qubits are required. However, this paper will explore how to directly apply the QAOA algorithm to the PUBO problem without converting the PUBO to QUBO, thereby reducing the utilization of qubits.

Asia Conference on Algorithms, Computing and Machine Learning (CACML)•Mar 28, 2025•1 citation

Unconstrained binary quadratic optimization

Erich Steiner, Th. M. Liebling, Komei Fukuda +1 more

•Jan 1, 2000•1 citation
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.
Previously, the approach to solving the PUBO (multiple unconstrained binary optimization) was to transform it into the QUBO (Quadratic Unconstrained Binary Optimization) via variable substitution. Variable substitution is bound to introduce new variables, and when using the QAOA algorithm for solution, it also implies that inevitably more controllable qubits are required. However, this paper will explore how to directly apply the QAOA algorithm to the PUBO problem without converting the PUBO to QUBO, thereby reducing the utilization of qubits.