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

Computer-aided chemical engineering/Computer aided chemical engineering

A Metaheuristic Optimization Algorithm for Binary Quadratic Problems

Otto Nissfolk, Tapio Westerlund

Published Jan 1, 2013• 0 citations
Publisher
DOI
10.1016/b978-0-444-63234-0.50079-8

Related papers

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

Springer eBooks•Jan 1, 2022•83 citations

Spectral Continuation for Conditioning-Aware Quadratic Binary Optimization: A Diagnostic and Metaheuristic Framework

Firas Khabour

•Jan 1, 2026•0 citations

Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT

Hans van Maaren, Joost P. Warners

Discrete Applied Mathematics•Dec 1, 2000•3 citations

Bandit-based Variable Fixing for Binary Optimization on GPU Parallel Computing

Ryota Yasudo

This paper explores whether reinforcement learning is capable of enhancing metaheuristics for the quadratic unconstrained binary optimization (QUBO), which have recently attracted attention as a solver for a wide range of combinatorial optimization problems. In particular, we introduce a novel approach called the bandit-based variable fixing (BVF). The key idea behind BVF is to regard an execution of an arbitrary metaheuristic with a variable fixed as a play of a slot machine. Thus, BVF explores variables to fix with the maximum expected reward, and executes a metaheuristic at the same time. The bandit-based approach is then extended to fix multiple variables. To accelerate solving multi-armed bandit problem, we implement a parallel algorithm for BVF on a GPU. Our results suggest that our proposed BVF enhances original metaheuristics.

Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)•Mar 1, 2023•4 citations

Binary Unconstrained Quadratic Optimization Problem

Gary A. Kochenberger, Fred Glover, Haibo Wang

Springer eBooks•Jan 1, 2013•9 citations

Unconstrained binary quadratic optimization

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

•Jan 1, 2000•1 citation
This paper explores whether reinforcement learning is capable of enhancing metaheuristics for the quadratic unconstrained binary optimization (QUBO), which have recently attracted attention as a solver for a wide range of combinatorial optimization problems. In particular, we introduce a novel approach called the bandit-based variable fixing (BVF). The key idea behind BVF is to regard an execution of an arbitrary metaheuristic with a variable fixed as a play of a slot machine. Thus, BVF explores variables to fix with the maximum expected reward, and executes a metaheuristic at the same time. The bandit-based approach is then extended to fix multiple variables. To accelerate solving multi-armed bandit problem, we implement a parallel algorithm for BVF on a GPU. Our results suggest that our proposed BVF enhances original metaheuristics.