IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v18y1970i2p306-311.html
   My bibliography  Save this article

An Enumeration Algorithm for Knapsack Problems

Author

Listed:
  • A. Victor Cabot

    (Indiana University, Bloomington, Indiana)

Abstract

Enumeration techniques have been shown to be successful for solving integer linear programming problems. The purpose of this paper is to apply the enumeration philosophy to the classical knapsack problem; it shows that this approach applies quite naturally to this type of integer linear program when combined with the Fourier-Motzkin elimination method for solving linear inequalities. Some computational results are reported.

Suggested Citation

  • A. Victor Cabot, 1970. "An Enumeration Algorithm for Knapsack Problems," Operations Research, INFORMS, vol. 18(2), pages 306-311, April.
    • Handle: RePEc:inm:oropre:v:18:y:1970:i:2:p:306-311
    DOI: 10.1287/opre.18.2.306
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.18.2.306
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.18.2.306?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. Balev, Stefan & Yanev, Nicola & Freville, Arnaud & Andonov, Rumen, 2008. "A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 186(1), pages 63-76, April.
    2. Paola Cappanera & Marco Trubian, 2005. "A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 82-98, February.
    3. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    4. Leonardo Boncinelli & Alessio Muscillo & Paolo Pin, 2022. "Efficiency and Stability in a Process of Teams Formation," Dynamic Games and Applications, Springer, vol. 12(4), pages 1101-1129, December.
    5. Y-J Seong & Y-G G & M-K Kang & C-W Kang, 2004. "An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(5), pages 547-552, May.
    6. Becker, Henrique & Buriol, Luciana S., 2019. "An empirical analysis of exact algorithms for the unbounded knapsack problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 84-99.
    7. Chia‐Shin Chung & Ming S. Hung & Walter O. Rom, 1988. "A hard knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 85-98, February.
    8. 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.
    9. 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.

    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:inm:oropre:v:18:y:1970:i:2:p:306-311. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.