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

An Algorithm for the Solution of 0-1 Loading Problems

Author

Listed:
  • Giorgio Ingargiola

    (California Institute of Technology, Pasadena, California)

  • James F. Korsh

    (California Institute of Technology, Pasadena, California)

Abstract

An enumerative algorithm is presented for the solution of 0-1 many-knapsack or loading problems. It is based on the principle that before a search is attempted as many decisions as possible should be made about inclusion or exclusion of objects from the knapsacks. This is accomplished by the introduction of a new ordering relation among the objects. This ordering relation, coupled with other relations we define, allows a drastic reduction in the extent of the search required to determine a solution.

Suggested Citation

  • Giorgio Ingargiola & James F. Korsh, 1975. "An Algorithm for the Solution of 0-1 Loading Problems," Operations Research, INFORMS, vol. 23(6), pages 1110-1119, December.
    • Handle: RePEc:inm:oropre:v:23:y:1975:i:6:p:1110-1119
    DOI: 10.1287/opre.23.6.1110
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.23.6.1110
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.23.6.1110?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. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    2. Alex Fukunaga, 2011. "A branch-and-bound algorithm for hard multiple knapsack problems," Annals of Operations Research, Springer, vol. 184(1), pages 97-119, April.
    3. Olivier Lalonde & Jean-François Côté & Bernard Gendron, 2022. "A Branch-and-Price Algorithm for the Multiple Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3134-3150, November.

    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:23:y:1975:i:6:p:1110-1119. 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.