Digital Annealing Engine for High-speed Solving of Constrained Binary Quadratic Problems on Multiple GPUs

This paper presents a digital annealing engine capable of high-speed solving the Binary Quadratic Programming Problem (BQP) with equality and inequality constraints. While many Quadratic Unconstrained Binary Optimization (QUBO) solvers have been developed for combinatorial optimization problems, the...

Full description

Bibliographic Details

Published in:	Proceedings of IEEE International Symposium on Consumer Electronics pp. 1 - 6
Main Authors:	Katayama, Kentaro, Yoneoka, Noboru, Kanda, Kouichi, Tamura, Hirotaka, Nakayama, Hiroshi, Watanabe, Yasuhiro
Format:	Conference Proceeding
Language:	English
Published:	IEEE 06.01.2024
Subjects:	Annealing Benchmark testing Binary Quadratic Programming Problem Combinatorial Optimization Engines inequality constraint Markov Chain Monte Carlo Monte Carlo methods one-hot constraint Optimization Quadratic programming Quadratic Unconstrained Binary Optimization Search problems
ISSN:	2158-4001
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!