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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of IEEE International Symposium on Consumer Electronics S. 1 - 6
Hauptverfasser:	Katayama, Kentaro, Yoneoka, Noboru, Kanda, Kouichi, Tamura, Hirotaka, Nakayama, Hiroshi, Watanabe, Yasuhiro
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 06.01.2024
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!