Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference5 articles.
1. Horowitz, E., Sahni, S.: Computing Partitions with Applications to the Knapsack Problem. Journal of ACM21, 277–292 (1974).
2. Ingargiola, G. P., Korsh, J. F.: Reduction Algorithm for Zero-One Single Knapsack Problems. Management Science20, 460–463 (1973).
3. Martello, S., Toth, P.: An Upper Bound for the Zero-One Knapsack Problem and a Branch and Bound Algorithm. European Journal of Operational Research1, 169–175 (1977).
4. Martello, S., Toth, P.: A Computational Study on Large-Size Unidimensional Knapsack Problems. Presented at the TIMS/ORSA Joint National Meeting, San Francisco (1977).
5. Nauss, R. M.: An Efficient Algorithm for the 0–1 Knapsack Problem. Management Science23, 27–31 (1976).
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献