An unbounded knapsack problem (KP) was investigated that describes the loading of items into a knapsack with a finite capacity, W, so as to maximize the total value of the loaded items. There were n ...
The Journal of the Operational Research Society, Vol. 47, No. 3 (Mar., 1996), pp. 457-462 (6 pages) In this paper we present a new branch and bound algorithm for solving a class of integer quadratic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback