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

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of IEEE International Symposium on Consumer Electronics s. 1 - 6
Hlavní autori:	Katayama, Kentaro, Yoneoka, Noboru, Kanda, Kouichi, Tamura, Hirotaka, Nakayama, Hiroshi, Watanabe, Yasuhiro
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 06.01.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!