IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v88y1996i3p578-582.html
   My bibliography  Save this article

Testing integer knapsacks for feasibility

Author

Listed:
  • Hansen, Paul
  • Ryan, Jennifer

Abstract

No abstract is available for this item.

Suggested Citation

  • Hansen, Paul & Ryan, Jennifer, 1996. "Testing integer knapsacks for feasibility," European Journal of Operational Research, Elsevier, vol. 88(3), pages 578-582, February.
    • Handle: RePEc:eee:ejores:v:88:y:1996:i:3:p:578-582
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00214-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. Jeremy F. Shapiro, 1968. "Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem," Operations Research, INFORMS, vol. 16(1), pages 103-121, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Iskander Aliev & Martin Henk, 2012. "LLL-reduction for integer knapsacks," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 613-626, November.
    2. Y-J Seong & Y-G G & M-K Kang & C-W Kang, 2004. "An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(5), pages 547-552, May.
    3. Iskander Aliev & Martin Henk, 2009. "Integer Knapsacks: Average Behavior of the Frobenius Numbers," Mathematics of Operations Research, INFORMS, vol. 34(3), pages 698-705, August.
    4. Pisinger, David & Saidi, Alima, 2017. "Tolerance analysis for 0–1 knapsack problems," European Journal of Operational Research, Elsevier, vol. 258(3), pages 866-876.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    2. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    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.
    4. Orlin, J. B., 1984. "Some Very Easy Knapsack/Partition Problems," Econometric Institute Archives 272288, Erasmus University Rotterdam.

    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:eee:ejores:v:88:y:1996:i:3:p:578-582. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.