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

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 appro...

Full description

Bibliographic Details

Published in:	Proceedings - Euromicro Workshop on Parallel and Distributed Processing pp. 154 - 158
Main Author:	Yasudo, Ryota
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.03.2023
Subjects:	decision making GPGPU Graphics processing units Linear programming Metaheuristics multi-armed bandit problem Parallel algorithms quadratic unconstrained binary optimization Reinforcement learning Search problems
ISSN:	2377-5750
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!