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

Knowledge-Based Systems

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

Ming Chen, Yuning Chen, Yonghao Du, Luona Wei, Yingwu Chen

Published Aug 8, 2020• 18 citations
Publisher
DOI
10.1016/j.knosys.2020.106366

Related papers

Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

Endre Boros, Peter L. Hammer, Gabriel Tavares

Journal of Heuristics•Feb 20, 2007•148 citations

A pointer network based deep learning algorithm for unconstrained binary quadratic programming problem

Shenshen Gu, Tao Hao, Hanmei Yao

Neurocomputing•Mar 10, 2020•29 citations

Learning to Solve Quadratic Unconstrained Binary Optimization in a Classification Way

Ming Chen, Yingwu Chen, Shang Xiang +5 more

neural information processing systems•Jan 1, 2024•1 citation

Learning Quadratic Unconstrained Binary Optimization Models for Quantum Annealing

Florian Richoux, Jean-François Baffier, Philippe Codognet

•Jan 1, 2025•0 citations

Reinforcement Learning based Quantum Approximate Optimization Algorithm for Vehicle Routing Problem.

Md. Aqib Aman, Fardin Azam Sakib

Reinforcement Learning–based Quantum Approximate Optimization Algorithm (QAOA-RL) is used to solve the Vehicle Routing Problem (VRP) by transforming it into a Quadratic Unconstrained Binary Optimization (QUBO) form. The RL agent learns to optimize QAOA parameters for better route selection. Results show that QAOA-RL achieves a lower total cost compared to exact ILP and heuristic Greedy Search methods. Although the training time is higher, the solution quality improves significantly for larger problem sizes. This study highlights QAOA-RL as a scalable and promising hybrid quantum–classical approach for real-world logistics optimization.

Transportation research procedia•Jan 1, 2026•0 citations

A Dataless Reinforcement Learning Approach to Rounding Hyperplane Optimization for Max-Cut

Gabriel Maliakal, Ismail Alkhouri, Alvaro Velasquez +2 more

The Maximum Cut (MaxCut) problem is NP-Complete, and obtaining its optimal solution is NP-hard in the worst case. As a result, heuristic-based algorithms are commonly used, though their design often requires significant domain expertise. More recently, learning-based methods trained on large (un)labeled datasets have been proposed; however, these approaches often struggle with generalizability and scalability. A well-known approximation algorithm for MaxCut is the Goemans-Williamson (GW) algorithm, which relaxes the Quadratic Unconstrained Binary Optimization (QUBO) formulation into a semidefinite program (SDP). The GW algorithm then applies hyperplane rounding by uniformly sampling a random hyperplane to convert the SDP solution into binary node assignments. In this paper, we propose a training-data-free approach based on a non-episodic reinforcement learning formulation, in which an agent learns to select improved rounding hyperplanes that yield better cuts than those produced by the GW algorithm. By optimizing over a Markov Decision Process (MDP), our method consistently achieves better cuts across large-scale graphs with varying densities and degree distributions.

arXiv:2505.13405•May 19, 2025•1 citation
Reinforcement Learning–based Quantum Approximate Optimization Algorithm (QAOA-RL) is used to solve the Vehicle Routing Problem (VRP) by transforming it into a Quadratic Unconstrained Binary Optimization (QUBO) form. The RL agent learns to optimize QAOA parameters for better route selection. Results show that QAOA-RL achieves a lower total cost compared to exact ILP and heuristic Greedy Search methods. Although the training time is higher, the solution quality improves significantly for larger problem sizes. This study highlights QAOA-RL as a scalable and promising hybrid quantum–classical approach for real-world logistics optimization.
The Maximum Cut (MaxCut) problem is NP-Complete, and obtaining its optimal solution is NP-hard in the worst case. As a result, heuristic-based algorithms are commonly used, though their design often requires significant domain expertise. More recently, learning-based methods trained on large (un)labeled datasets have been proposed; however, these approaches often struggle with generalizability and scalability. A well-known approximation algorithm for MaxCut is the Goemans-Williamson (GW) algorithm, which relaxes the Quadratic Unconstrained Binary Optimization (QUBO) formulation into a semidefinite program (SDP). The GW algorithm then applies hyperplane rounding by uniformly sampling a random hyperplane to convert the SDP solution into binary node assignments. In this paper, we propose a training-data-free approach based on a non-episodic reinforcement learning formulation, in which an agent learns to select improved rounding hyperplanes that yield better cuts than those produced by the GW algorithm. By optimizing over a Markov Decision Process (MDP), our method consistently achieves better cuts across large-scale graphs with varying densities and degree distributions.