IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v4y2012i3p214-224.html
   My bibliography  Save this article

A procedure-based heuristic for 0-1 Multiple Knapsack Problems

Author

Listed:
  • Mohamed Esseghir Lalami
  • Moussa Elkihel
  • Didier El Baz
  • Vincent Boyer

Abstract

In this paper, we present a heuristic which derives a feasible solution for the Multiple Knapsack Problem (MKP). The proposed heuristic called RCH, is a recursive method that performs computation on the core of knapsacks. The RCH heuristic is compared with the MTHM heuristic of Martello and Toth. Computational results on randomly generated instances show that the proposed approach gives better gap and smaller restitution times.

Suggested Citation

  • Mohamed Esseghir Lalami & Moussa Elkihel & Didier El Baz & Vincent Boyer, 2012. "A procedure-based heuristic for 0-1 Multiple Knapsack Problems," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 4(3), pages 214-224.
    • Handle: RePEc:ids:ijmore:v:4:y:2012:i:3:p:214-224
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=46684
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. 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. Martello, Silvano & Monaci, Michele, 2020. "Algorithmic approaches to the multiple knapsack assignment problem," Omega, Elsevier, vol. 90(C).

    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:ids:ijmore:v:4:y:2012:i:3:p:214-224. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    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.