Academic Journal
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
| العنوان: | On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem |
|---|---|
| المؤلفون: | Schulze, Britta, Stiglmayr, Michael, Paquete, Luís, Fonseca, Carlos M., Willems, David, Ruzika, Stefan |
| بيانات النشر: | Springer |
| سنة النشر: | 2020 |
| المجموعة: | EconStor (German National Library of Economics, ZBW) |
| مصطلحات موضوعية: | ddc:330, Quadratic knapsack problem, Approximation algorithm, Multiobjective combinatorial optimization, Hypervolume |
| الوصف: | In this article, we introduce the rectangular knapsack problem as a special case of the quadratic knapsack problem consisting in the maximization of the product of two separate knapsack profits subject to a cardinality constraint. We propose a polynomial time algorithm for this problem that provides a constant approximation ratio of 4.5. Our experimental results on a large number of artificially generated problem instances show that the average ratio is far from theoretical guarantee. In addition, we suggest refined versions of this approximation algorithm with the same time complexity and approximation ratio that lead to even better experimental results. |
| نوع الوثيقة: | article in journal/newspaper |
| اللغة: | English |
| تدمد: | 1432-5217 |
| Relation: | Journal: Mathematical Methods of Operations Research; Volume: 92; Year: 2020; Issue: 1; Pages: 107-132; Berlin, Heidelberg: Springer; https://hdl.handle.net/10419/288295 |
| DOI: | 10.1007/s00186-020-00702-0 |
| الاتاحة: | https://hdl.handle.net/10419/288295 https://doi.org/10.1007/s00186-020-00702-0 |
| Rights: | http://www.econstor.eu/dspace/Nutzungsbedingungen ; https://creativecommons.org/licenses/by/4.0/ |
| رقم الانضمام: | edsbas.6CFBE89B |
| قاعدة البيانات: | BASE |
Full Text Finder | تدمد: | 14325217 |
|---|---|
| DOI: | 10.1007/s00186-020-00702-0 |