Abstract
The 0–1 quadratic knapsack problem (QKP) consists in maximizing a quadratic pseudo-Boolean function with positive coefficients subject to a linear capacity constraint. In this paper we present an exact method to solve this problem. This method makes use of the computation of an upper bound for (QKP) which is derived from Lagrangian decomposition. It allows us to find the optimum of instances with up to 150 variables whatever their density, and with up to 300 variables for medium and low density.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
