Dynamic programming algorithms for the knapsack problem
暂无分享,去创建一个
The knapsack problem is one of the "classical" problems in Operations Research. In this paper we present a number of APL codes based on the dynamic programming approach to such problems. Although these codes can be used effectively to solve small knapsack problems, they were developed primarily as teaching aids.
[1] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..
[2] Martin J. Dürst,et al. Re , 1988 .
[3] Mashe Sniedovich,et al. Dynamic Programming , 1991 .
[4] Harvey M. Salkin,et al. The knapsack problem: A survey , 1975 .
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .