IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v22y1975i1p127-144.html
   My bibliography  Save this article

The knapsack problem: A survey

Author

Listed:
  • Harvey M. Salkin
  • Cornelis A. De Kluyver

Abstract

A unifying survey of the literature related to the knapsack problem; that is, maximize \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_i {v_i x_{i,} } $\end{document}, subject to \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_j {w_i x_i W} $\end{document} and xi ⩾ 0, integer; where vi, wi and W are known integers, and wi (i = 1, 2, …, N) and W are positive. Various uses, including those in group theory and in other integer programming algorithms, as well as applications from the literature, are discussed. Dynamic programming, branch and bound, search enumeration, heuristic methods, and other solution techniques are presented. Computational experience, and extensions of the knapsack problem, such as to the multi‐dimensional case, are also considered.

Suggested Citation

  • Harvey M. Salkin & Cornelis A. De Kluyver, 1975. "The knapsack problem: A survey," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 22(1), pages 127-144, March.
  • Handle: RePEc:wly:navlog:v:22:y:1975:i:1:p:127-144
    DOI: 10.1002/nav.3800220110
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800220110
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.3800220110?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. 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.
    2. Setzer, Thomas & Blanc, Sebastian M., 2020. "Empirical orthogonal constraint generation for Multidimensional 0/1 Knapsack Problems," European Journal of Operational Research, Elsevier, vol. 282(1), pages 58-70.
    3. Wilbaut, Christophe & Todosijevic, Raca & Hanafi, Saïd & Fréville, Arnaud, 2023. "Heuristic and exact reduction procedures to solve the discounted 0–1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 304(3), pages 901-911.
    4. Haihao Lu & Luyang Zhang, 2024. "The Power of Linear Programming in Sponsored Listings Ranking: Evidence from Field Experiments," Papers 2403.14862, arXiv.org.
    5. Hasan Pirkul, 1987. "A heuristic solution procedure for the multiconstraint zero‐one knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 161-172, April.
    6. Zhou, Qing & Hao, Jin-Kao & Wu, Qinghua, 2022. "A hybrid evolutionary search for the generalized quadratic multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 296(3), pages 788-803.

    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:wly:navlog:v:22:y:1975:i:1:p:127-144. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.