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

Full description

Bibliographic Details
Published in:Tạp chí Khoa học
Main Authors: NGUYEN Thi Uyen, NGUYEN Canh An, DO Mai Trang, TRAN Xuan Sang
Format: Article
Language:English
Published: Trường Đại học Vinh 2022-12-01
Subjects:
quantum computing
quantum annealing
max-cover problem
Online Access:https://vujs.vn/api/view.aspx?cid=ba5c4d8e-066a-43d3-9af7-65af3a648eaf

Internet

https://vujs.vn/api/view.aspx?cid=ba5c4d8e-066a-43d3-9af7-65af3a648eaf

Similar Items