IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v123y2000i2p333-345.html
   My bibliography  Save this article

Approximation algorithms for knapsack problems with cardinality constraints

Author

Listed:
  • Caprara, Alberto
  • Kellerer, Hans
  • Pferschy, Ulrich
  • Pisinger, David

Abstract

No abstract is available for this item.

Suggested Citation

  • Caprara, Alberto & Kellerer, Hans & Pferschy, Ulrich & Pisinger, David, 2000. "Approximation algorithms for knapsack problems with cardinality constraints," European Journal of Operational Research, Elsevier, vol. 123(2), pages 333-345, June.
    • Handle: RePEc:eee:ejores:v:123:y:2000:i:2:p:333-345
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00261-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Frieze, A. M. & Clarke, M. R. B., 1984. "Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses," European Journal of Operational Research, Elsevier, vol. 15(1), pages 100-109, January.
    2. Magazine, M. J. & Oguz, Osman, 1981. "A fully polynomial approximation algorithm for the 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 8(3), pages 270-273, November.
    3. Hans Kellerer & Ulrich Pferschy, 1999. "A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 59-71, July.
    4. Eugene L. Lawler, 1979. "Fast Approximation Algorithms for Knapsack Problems," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 339-356, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Aardal, Karen & van den Berg, Pieter L. & Gijswijt, Dion & Li, Shanfei, 2015. "Approximation algorithms for hard capacitated k-facility location problems," European Journal of Operational Research, Elsevier, vol. 242(2), pages 358-368.
    2. Kung, Ling-Chieh & Liao, Wei-Hung, 2018. "An approximation algorithm for a competitive facility location problem with network effects," European Journal of Operational Research, Elsevier, vol. 267(1), pages 176-186.
    3. R. K. Ahuja & J. B. Orlin & S. Pallottino & M. P. Scaparra & M. G. Scutellà, 2004. "A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem," Management Science, INFORMS, vol. 50(6), pages 749-760, June.
    4. Jooken, Jorik & Leyman, Pieter & De Causmaecker, Patrick, 2022. "A new class of hard problem instances for the 0–1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 841-854.
    5. Darmann, Andreas & Nicosia, Gaia & Pferschy, Ulrich & Schauer, Joachim, 2014. "The Subset Sum game," European Journal of Operational Research, Elsevier, vol. 233(3), pages 539-549.
    6. Mu'alem, Ahuva & Nisan, Noam, 2008. "Truthful approximation mechanisms for restricted combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 64(2), pages 612-631, November.
    7. Yalçın Akçay & Haijun Li & Susan Xu, 2007. "Greedy algorithm for the general multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 150(1), pages 17-29, March.
    8. Klamler, Christian & Pferschy, Ulrich & Ruzika, Stefan, 2012. "Committee selection under weight constraints," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 48-56.
    9. Elif Akçalı & Alper Üngör & Reha Uzsoy, 2005. "Short‐term capacity allocation problem with tool and setup constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(8), pages 754-764, December.
    10. Jinwen Ou & Xueling Zhong, 2017. "Order acceptance and scheduling with consideration of service level," Annals of Operations Research, Springer, vol. 248(1), pages 429-447, January.
    11. Luca Bertazzi, 2012. "Minimum and Worst-Case Performance Ratios of Rollout Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 378-393, February.
    12. Absi, Nabil & Dauzère-Pérès, Stéphane & Kedad-Sidhoum, Safia & Penz, Bernard & Rapine, Christophe, 2013. "Lot sizing with carbon emission constraints," European Journal of Operational Research, Elsevier, vol. 227(1), pages 55-61.
    13. Talla Nobibon, Fabrice & Leus, Roel & Spieksma, Frits C.R., 2011. "Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms," European Journal of Operational Research, Elsevier, vol. 210(3), pages 670-683, May.
    14. Della Croce, Federico & Salassa, Fabio & Scatamacchia, Rosario, 2017. "A new exact approach for the 0–1 Collapsing Knapsack Problem," European Journal of Operational Research, Elsevier, vol. 260(1), pages 56-69.
    15. Yoon, Yourim & Kim, Yong-Hyuk & Moon, Byung-Ro, 2012. "A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 366-376.
    16. Iida, Hiroshi, 2014. "A further addendum to "Some thoughts on the 2-approximation algorithm for knapsack problems: A survey"," ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) 10252/5386, Otaru University of Commerce.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    2. Rui Diao & Ya-Feng Liu & Yu-Hong Dai, 2017. "A new fully polynomial time approximation scheme for the interval subset sum problem," Journal of Global Optimization, Springer, vol. 68(4), pages 749-775, August.
    3. Thomas Erlebach & Hans Kellerer & Ulrich Pferschy, 2002. "Approximating Multiobjective Knapsack Problems," Management Science, INFORMS, vol. 48(12), pages 1603-1612, December.
    4. Arnaud Fréville & SaÏd Hanafi, 2005. "The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects," Annals of Operations Research, Springer, vol. 139(1), pages 195-227, October.
    5. Zhenbo Wang & Wenxun Xing, 2009. "A successive approximation algorithm for the multiple knapsack problem," Journal of Combinatorial Optimization, Springer, vol. 17(4), pages 347-366, May.
    6. Rebi Daldal & Iftah Gamzu & Danny Segev & Tonguç Ünlüyurt, 2016. "Approximation algorithms for sequential batch‐testing of series systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(4), pages 275-286, June.
    7. Dolgui, Alexandre & Kovalev, Sergey & Pesch, Erwin, 2015. "Approximate solution of a profit maximization constrained virtual business planning problem," Omega, Elsevier, vol. 57(PB), pages 212-216.
    8. Hans Kellerer & Ulrich Pferschy, 1999. "A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 59-71, July.
    9. Luca Bertazzi, 2012. "Minimum and Worst-Case Performance Ratios of Rollout Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 378-393, February.
    10. Zhou Xu, 2013. "The knapsack problem with a minimum filling constraint," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 56-63, February.
    11. Aardal, Karen & van den Berg, Pieter L. & Gijswijt, Dion & Li, Shanfei, 2015. "Approximation algorithms for hard capacitated k-facility location problems," European Journal of Operational Research, Elsevier, vol. 242(2), pages 358-368.
    12. Haris Aziz & Sujit Gujar & Manisha Padala & Mashbat Suzuki & Jeremy Vollen, 2022. "Coordinating Monetary Contributions in Participatory Budgeting," Papers 2206.05966, arXiv.org, revised Feb 2023.
    13. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    14. Francisco Castillo-Zunino & Pinar Keskinocak, 2021. "Bi-criteria multiple knapsack problem with grouped items," Journal of Heuristics, Springer, vol. 27(5), pages 747-789, October.
    15. Lee, Tae-Eog & Oh, Geun Tae, 1997. "The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem," European Journal of Operational Research, Elsevier, vol. 103(3), pages 584-594, December.
    16. Kameng Nip & Zhenbo Wang, 2019. "On the approximability of the two-phase knapsack problem," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1155-1179, November.
    17. Ruxian Wang & Ozge Sahin, 2018. "The Impact of Consumer Search Cost on Assortment Planning and Pricing," Management Science, INFORMS, vol. 64(8), pages 3649-3666, August.
    18. Yoon, Yourim & Kim, Yong-Hyuk & Moon, Byung-Ro, 2012. "A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 366-376.
    19. Kellerer, Hans & Kubzin, Mikhail A. & Strusevich, Vitaly A., 2009. "Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval," European Journal of Operational Research, Elsevier, vol. 199(1), pages 111-116, November.
    20. Jooken, Jorik & Leyman, Pieter & De Causmaecker, Patrick, 2022. "A new class of hard problem instances for the 0–1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 841-854.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:123:y:2000:i:2:p:333-345. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.