IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v34y1988i3p402-410.html
   My bibliography  Save this article

Note---An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems---A Parametric Approach

Author

Listed:
  • Jae Sik Lee

    (The Wharton School, University of Pennsylvania, Philadelphia, Pennsylvania 19104)

  • Monique Guignard

    (The Wharton School, University of Pennsylvania, Philadelphia, Pennsylvania 19104)

Abstract

A new approximate algorithm for multidimensional zero-one knapsack problems with all positive coefficients is presented. The procedure is controlled by three parameters which affect the tradeoff between solution quality and computation time and whose values are set by the users. For 48 test problems with 5 to 20 constraints and 6 to 500 variables, the solution found was on the average within 0.34% of the optimum and the computation time was the shortest compared with three other well-known heuristics.

Suggested Citation

  • Jae Sik Lee & Monique Guignard, 1988. "Note---An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems---A Parametric Approach," Management Science, INFORMS, vol. 34(3), pages 402-410, March.
    • Handle: RePEc:inm:ormnsc:v:34:y:1988:i:3:p:402-410
    DOI: 10.1287/mnsc.34.3.402
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.34.3.402
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.34.3.402?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. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    2. Dimitris Bertsimas & Ramazan Demir, 2002. "An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems," Management Science, INFORMS, vol. 48(4), pages 550-565, April.

    More about this item

    Keywords

    programming: integer algorithms; heuristic;

    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:ormnsc:v:34:y:1988:i:3:p:402-410. 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.