Abstract
A branch and bound procedure is presented to solve the quadratic knapsack problem. The optimal values of the objective function of linear knapsack problems will be applied as bounds. In case of solving these linear knapsack problems by means of dynamic programming, the cost of the solution of the initial problem can be substantially reduced. Numerical experiments will be presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
