A quantum annealing approach to solve max-cover problem
The Max-Cover is a NP-hard problem. Therefore, the heuristic approach is suitable to solve this problem for large instances. Quantum annealing is a heuristic quantum optimization algorithm that can be used to handle the Max-Cover problem. Recent developments in quantum technology allows creating pro...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Trường Đại học Vinh
2022-12-01
|
Series: | Tạp chí Khoa học |
Subjects: | |
Online Access: | https://vujs.vn/api/view.aspx?cid=ba5c4d8e-066a-43d3-9af7-65af3a648eaf |