Quantum relaxation for solving multiple knapsack problems

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

Full description

Saved in:
Bibliographic Details
Main Authors: SHARMA, Monit, YAN, Jin, LAU, Hoong Chuin, RAYMOND, Rudy
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2024
Subjects:
Constrained optimization
Knapsack constraints
Quantum Hamiltonians
Quantum random access code
Linear relaxation
Computer Engineering
Software Engineering
Online Access: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
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

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

Similar Items