Quantum relaxation for solving multiple knapsack problems

Combinatorial problems are a common challenge in business, requiring finding optimal solutions under specified constraints. While significant progress has been made with variational approaches such as QAOA, most problems addressed are unconstrained (such as Max-Cut). In this study, we investigate a...

全面介紹

Saved in:
書目詳細資料
Main Authors: SHARMA, Monit, YAN, Jin, LAU, Hoong Chuin, RAYMOND, Rudy
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 2024
主題:
在線閱讀:https://ink.library.smu.edu.sg/sis_research/9969
https://ink.library.smu.edu.sg/context/sis_research/article/10969/viewcontent/2404.19474v2__1_.pdf
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English