IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v3y1999i1d10.1023_a1009821323279.html
   My bibliography  Save this article

A Note on the Max-Min 0-1 Knapsack Problem

Author

Listed:
  • Hiroshi Iida

    (Otaru University of Commerce)

Abstract

In this paper we propose new lower and upper bounds for the max-min 0-1 knapsack problem, employing a mixture of two relaxations. In addition, in order to expose whether the bounds are practical or not, we implement a method incorporating the bounds to achieve an optimal solution of the problem.

Suggested Citation

  • Hiroshi Iida, 1999. "A Note on the Max-Min 0-1 Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 89-94, July.
    • Handle: RePEc:spr:jcomop:v:3:y:1999:i:1:d:10.1023_a:1009821323279
    DOI: 10.1023/A:1009821323279
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009821323279
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009821323279?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
    ---><---

    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. Alexandre Belloni & Mitchell J. Lovett & William Boulding & Richard Staelin, 2012. "Optimal Admission and Scholarship Decisions: Choosing Customized Marketing Offers to Attract a Desirable Mix of Customers," Marketing Science, INFORMS, vol. 31(4), pages 621-636, July.

    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:spr:jcomop:v:3:y:1999:i:1:d:10.1023_a:1009821323279. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.