Ising Machine Approach to the Lecturer-Student Assignment Problem

Ising machines are efficient solvers for combinatorial optimization problems (COPs). After mapping COPs to Quadratic Unconstrained Binary Optimization (QUBO) problems, Ising machines search for the lowest energy solution of the QUBO corresponding to the optimal solution of the COP. Herein we propose...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE Access Jg. 12; S. 49752 - 49761
Hauptverfasser:	Tomita, Sora, Shirai, Tatsuhiko, Togawa, Nozomu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 2024 Institute of Electrical and Electronics Engineers (IEEE) The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Combinatorial analysis Combinatorial optimization problem Combinatorial testing Computational modeling Ising machine Ising model Mathematical models Operations research Optimization Quantum annealing QUBO Search problems Simulated annealing Stationary state Students
ISSN:	2169-3536, 2169-3536
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!