IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v27y1979i3p548-566.html
   My bibliography  Save this article

Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound

Author

Listed:
  • Eric V. Denardo

    (Yale University, New Haven, Connecticut)

  • Bennett L. Fox

    (University of Montreal, Montreal, Quebec)

Abstract

This paper contains new, fast methods for handling two types of group knapsack networks—those having only unbounded variables and those having some bounded variables. The latter are embedded in a new branch-and-bound scheme for pure integer programs. This implicit enumeration scheme is nonredundant, which distinguishes it from the literature.

Suggested Citation

  • Eric V. Denardo & Bennett L. Fox, 1979. "Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound," Operations Research, INFORMS, vol. 27(3), pages 548-566, June.
    • Handle: RePEc:inm:oropre:v:27:y:1979:i:3:p:548-566
    DOI: 10.1287/opre.27.3.548
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.27.3.548
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.27.3.548?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. Hansen, Paul & Ryan, Jennifer, 1996. "Testing integer knapsacks for feasibility," European Journal of Operational Research, Elsevier, vol. 88(3), pages 578-582, February.
    2. Orlin, J. B., 1984. "Some Very Easy Knapsack/Partition Problems," Econometric Institute Archives 272288, Erasmus University Rotterdam.
    3. Gross, Eitan, 2016. "On the Bellman’s principle of optimality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 217-221.

    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:inm:oropre:v:27:y:1979:i:3:p:548-566. 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.