Author:
Pisinger David,Toth Paolo
Reference118 articles.
1. J. H. Ahrens and G. Finke (1975), “Merging and Sorting Applied to the Zero-One Knapsack Problem”, Operations Research, 23, 1099–1109.
2. XIth International Symposium on Mathematical Programming;L Aittoniemi,1982
3. G. d’Atri, C. Puech (1982), “Probabilistic analysis of the subset-sum problem”, Discrete Applied Mathematics, 4, 329–334.
4. Operations Research;D Avis,1980
5. E. Balas (1975), “Facets of the Knapsack Polytope”, Mathematical Programming, 8, 146–164.
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献