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

Technical Note—The Multiperiod Knapsack Problem

Author

Listed:
  • Bruce H. Faaland

    (University of Washington, Seattle, Washington)

Abstract

In the multiperiod knapsack problem the decision maker faces a horizon of m periods. Associated with each period are a number of types of items, each with a value and weight. Subject to the requirement that the cumulative capacity of the knapsack in each period i cannot be exceeded by items chosen in periods 1, …, i , the decision maker chooses the most valuable knapsack possible. A branch and bound algorithm exploits the special structure of the multiperiod knapsack problem by calculating bounds by the direct solution of linear programs with m constraints in 0( m ) operations. Computational experience is reported on problems ranging in size up to 200 constraints and 1,000 general integer variables.

Suggested Citation

  • Bruce H. Faaland, 1981. "Technical Note—The Multiperiod Knapsack Problem," Operations Research, INFORMS, vol. 29(3), pages 612-616, June.
    • Handle: RePEc:inm:oropre:v:29:y:1981:i:3:p:612-616
    DOI: 10.1287/opre.29.3.612
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.29.3.612
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.29.3.612?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. Gasparini, Gaia & Brunelli, Matteo & Chiriac, Marius Dan, 2022. "Multi-period portfolio decision analysis: A case study in the infrastructure management sector," Operations Research Perspectives, Elsevier, vol. 9(C).
    2. Faramroze G. Engineer & George L. Nemhauser & Martin W. P. Savelsbergh & Jin-Hwa Song, 2012. "The Fixed-Charge Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 578-596, November.
    3. Faramroze G. Engineer & Kevin C. Furman & George L. Nemhauser & Martin W. P. Savelsbergh & Jin-Hwa Song, 2012. "A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing," Operations Research, INFORMS, vol. 60(1), pages 106-122, February.
    4. Kameng Nip & Zhenbo Wang, 2019. "On the approximability of the two-phase knapsack problem," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1155-1179, November.
    5. Edward Y H Lin & Chung-Min Wu, 2004. "The multiple-choice multi-period knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 187-197, February.

    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:29:y:1981:i:3:p:612-616. 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.