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

Solution of the zero-one multiple knapsack problem

Author

Listed:
  • Martello, Silvano
  • Toth, Paolo

Abstract

No abstract is available for this item.

Suggested Citation

  • Martello, Silvano & Toth, Paolo, 1980. "Solution of the zero-one multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 4(4), pages 276-283, April.
  • Handle: RePEc:eee:ejores:v:4:y:1980:i:4:p:276-283
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(80)90112-5
    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.

    Citations

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


    Cited by:

    1. Johnston, Robert E. & Khan, Lutfar R., 1995. "Bounds for nested knapsack problems," European Journal of Operational Research, Elsevier, vol. 81(1), pages 154-165, February.
    2. Jayant R. Kalagnanam & Milind W. Dawande & Mark Trumbo & Ho Soo Lee, 2000. "The Surplus Inventory Matching Problem in the Process Industry," Operations Research, INFORMS, vol. 48(4), pages 505-516, August.
    3. 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.
    4. M. Dawande & J. Kalagnanam & P. Keskinocak & F.S. Salman & R. Ravi, 2000. "Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions," Journal of Combinatorial Optimization, Springer, vol. 4(2), pages 171-186, June.
    5. 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.
    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:eee:ejores:v:4:y:1980:i:4:p:276-283. 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: 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.