Author:
Kellerer Hans,Pferschy Ulrich
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. A. Caprara, H. Kellerer, U. Pferschy, D. Pisinger, “Approximation algorithms for knapsack problems with cardinality constraints”, Technical Report 01/1998, Faculty of Economics, University Graz, submitted.
2. H. Kellerer, R. Mansini, U. Pferschy, M.G. Speranza, “An efficient fully polynomial approximation scheme for the subset-sum problem”, Technical Report 14/1997, Fac. of Economics, Univ. Graz, submitted, see also Proceedings of the 8th ISAAC Symposium, Springer Lecture Notes in Computer Science 1350, 394–403, 1997.
3. E. Lawler, “Fast approximation algorithms for knapsack problems”, Mathematics of Operations Research 4, 339–356, 1979.
4. M.J. Magazine, O. Oguz, “A fully polynomial approximation algorithm for the 0-1 knapsack problem”, European Journal of Operational Research, 8, 270–273, 1981.
5. S. Martello, P. Toth, Knapsack Problems, J. Wiley & Sons, 1990.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献