Abstract
The ordinary knapsack problem is to find the optimal combination of items to be packed in a knapsack under a single constraint on the total allowable resources, where all coefficients in the objective function and in the constraint are constant.
In this paper, a generalized knapsack problem with coefficients depending on variable parameters is proposed and discussed. Developing an effective branch and bound algorithm for this problem, the concept of relaxation and the efficiency function introduced here will play important roles. Furthermore, a relation between the algorithm and the dynamic programming approach is discussed, and subsequently it will be shown that the ordinary 0–1 knapsack problem, the linear programming knapsack problem and the single constrained linear programming problem with upper-bounded variables are special cases of the interested problem. Finally, practical applications of the problem and its computational experiences will be shown.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.S. Garfinkel and G.L. Nemhauser,Integer programming (Wiley, New York, 1972).
P.C. Gilmore and R.E. Gomory, “The theory and computation of knapsack functions”,Operations Research 14 (1966) 1045–1074.
H. Greenberg and R.L. Hegerich, “A branch search algorithm for the knapsack problem”,Management Science 16 (1970) 327–332.
J.D. Guy, “Security constrained unit commitment”,IEEE Transaction on Power Apparatus and Systems 90 (1971) 1385–1390.
K. Hitomi, “The analysis of optimal production speed and a practical solving method for a special linear programming”,Journal of Japan Industrial Management Association 45 (1970) 29–38. (in Japanese)
P.J. Kolesar, “A branch and bound algorithm for the knapsack problem”,Management Science 13 (1967) 723–735.
P.G. Lowery, “Generating unit commitment by dynamic programming”,IEEE Transaction on Power Apparatus and Systems 85 (1966) 422–426.
T.L. Morin and R.E. Marsten, “Branch-and-bound strategies for dynamic programming”,Operations Research 24 (1976) 611–627.
H. Suzuki, “A generalized knapsack problem with coefficients depending on variable parameters”, Research Reports on Information Sciences, Tokyo Institute of Technology, Tokyo (1974).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Suzuki, H. A generalized knapsack problem with variable coefficients. Mathematical Programming 15, 162–176 (1978). https://doi.org/10.1007/BF01609015
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01609015