IDEAS home Printed from https://ideas.repec.org/p/mse/wpsorb/b04024.html
   My bibliography  Save this paper

An exact algorithm for the multiple-choice multidimensional knapsack problem

Author

Listed:
  • Mhand Hifi

    (LaRIA et CERMSEM)

  • Slim Sadfi

    (LaRIA et CERMSEM)

  • Abdelkader Sbihi

    (CERMSEM)

Abstract

In this paper, we propose an optimal algorithm for the Multiple-choice Multidimensional Knapsack Problem MMKP. The main principle of the approach is twofold: (i) to generate an initial solution, and (ii) at different levels of the tree search to determine a new upper bound used with a best-first search strategy. The developed method was able to optimally solve the MMKP. The performance of the exact algorithm is evaluated on a set of small and medium instances. This algorithm is parallelizable and it is one of its important feature

Suggested Citation

  • Mhand Hifi & Slim Sadfi & Abdelkader Sbihi, 2004. "An exact algorithm for the multiple-choice multidimensional knapsack problem," Cahiers de la Maison des Sciences Economiques b04024, Université Panthéon-Sorbonne (Paris 1).
    • Handle: RePEc:mse:wpsorb:b04024
    as

    Download full text from publisher

    File URL: https://halshs.archives-ouvertes.fr/halshs-03322716
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Sylvain Barde, 2011. "Ignorance is bliss: rationality, information and equilibrium," Studies in Economics 1103, School of Economics, University of Kent.
    2. Sylvain Barde, 2012. "Back to the future: economic rationality and maximum entropy prediction," Studies in Economics 1202, School of Economics, University of Kent.
    3. repec:hal:spmain:info:hdl:2441/5l6uh8ogmqildh09h56484hg0 is not listed on IDEAS
    4. N. Cherfi & M. Hifi, 2010. "A column generation method for the multiple-choice multi-dimensional knapsack problem," Computational Optimization and Applications, Springer, vol. 46(1), pages 51-73, May.
    5. Sylvain Barde, 2015. "Back to the Future: Economic Self-Organisation and Maximum Entropy Prediction," Computational Economics, Springer;Society for Computational Economics, vol. 45(2), pages 337-358, February.
    6. repec:spo:wpmain:info:hdl:2441/5l6uh8ogmqildh09h56484hg0 is not listed on IDEAS

    More about this item

    Keywords

    Combinatorial optimization; branch and bound; sequential algorithm; Knapsack problem;
    All these keywords.

    JEL classification:

    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:mse:wpsorb:b04024. 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: Lucie Label (email available below). General contact details of provider: https://edirc.repec.org/data/msep1fr.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.