IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v26y1979i1p41-46.html
   My bibliography  Save this article

Computational results with a branch‐and‐bound algorithm for the general knapsack problem

Author

Listed:
  • R. L. Bulfin
  • R. G. Parker
  • C. M. Shetty

Abstract

In this paper, a branch‐and‐bound procedure is presented for treating the general knapsack problem. The fundamental notion of the procedure involves a variation of traditional branching strategies as well as the incorporation of penalties in order to improve bounds. Substantial computational experience has been obtained, the results of which would indicate the feasibility of the procedure for problems of large size.

Suggested Citation

  • R. L. Bulfin & R. G. Parker & C. M. Shetty, 1979. "Computational results with a branch‐and‐bound algorithm for the general knapsack problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 26(1), pages 41-46, March.
    • Handle: RePEc:wly:navlog:v:26:y:1979:i:1:p:41-46
    DOI: 10.1002/nav.3800260105
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800260105
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800260105?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. Barniv, Ran & Mehrez, Abraham & Kline, Douglas M., 2000. "Confidence intervals for controlling the probability of bankruptcy," Omega, Elsevier, vol. 28(5), pages 555-565, October.
    2. D'Urso, Pierpaolo, 2003. "Linear regression analysis for fuzzy/crisp input and fuzzy/crisp output data," Computational Statistics & Data Analysis, Elsevier, vol. 42(1-2), pages 47-72, February.
    3. Chia‐Shin Chung & Ming S. Hung & Walter O. Rom, 1988. "A hard knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 85-98, February.
    4. Shin, Dong Wan & Park, Chul Gyu & Park, Taesung, 2001. "Testing for one-sided group effects in repeated measures study," Computational Statistics & Data Analysis, Elsevier, vol. 37(2), pages 233-247, August.

    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:wly:navlog:v:26:y:1979:i:1:p:41-46. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.