Abstract
AbstractWe consider the product knapsack problem, which is the variant of the classical 0-1 knapsack problem where the objective consists of maximizing the product of the profits of the selected items. These profits are allowed to be positive or negative. We present the first fully polynomial-time approximation scheme for the product knapsack problem, which is known to be weakly -hard. Moreover, we analyze the approximation quality achieved by a natural extension of the classical knapsack greedy procedure to the product knapsack problem.
Funder
Karl-Franzens-Universität Graz
Publisher
Springer Science and Business Media LLC
Reference5 articles.
1. D’Ambrosio, C., Furini, F., Monaci, M., Traversi, E.: On the product knapsack problem. Optim. Lett. 12(4), 691–712 (2018)
2. Halman, N., Kovalyov, M., Quilliot, A., Shabtay, D., Zofi, M.: Bi-criteria path problem with minimum length and maximum survival probability. OR Spectr. 41, 469–489 (2019)
3. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)
4. Martello, S., Toth, P.: Knapsack problems: Algorithms and computer implementations. Wiley, New Jersey (1990)
5. Pferschy, U., Schauer, J., Thielen, C.: The product knapsack problem: Approximation and complexity. arXiv: 1901.00695. (2019)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献