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

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE Access Ročník 12; s. 49752 - 49761
Hlavní autoři:	Tomita, Sora, Shirai, Tatsuhiko, Togawa, Nozomu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 2024 Institute of Electrical and Electronics Engineers (IEEE) The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!