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

Two linear approximation algorithms for the subset-sum problem

Author

Listed:
  • Kellerer, Hans
  • Mansini, Renata
  • Speranza, Maria Grazia

Abstract

No abstract is available for this item.

Suggested Citation

  • Kellerer, Hans & Mansini, Renata & Speranza, Maria Grazia, 2000. "Two linear approximation algorithms for the subset-sum problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 289-296, January.
    • Handle: RePEc:eee:ejores:v:120:y:2000:i:2:p:289-296
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00157-5
    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. Silvano Martello & Paolo Toth, 1984. "A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem," Management Science, INFORMS, vol. 30(6), pages 765-771, June.
    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. Liliana Grigoriu & Dirk Briskorn, 2017. "Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations," Journal of Scheduling, Springer, vol. 20(2), pages 183-197, April.

    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. Gérard Cornuéjols & Milind Dawande, 1999. "A Class of Hard Small 0-1 Programs," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 205-210, May.
    2. Silvano Martello & David Pisinger & Paolo Toth, 1999. "Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem," Management Science, INFORMS, vol. 45(3), pages 414-424, March.
    3. Dahmani, Isma & Hifi, Mhand & Wu, Lei, 2016. "An exact decomposition algorithm for the generalized knapsack sharing problem," European Journal of Operational Research, Elsevier, vol. 252(3), pages 761-774.
    4. Toth, Paolo, 2000. "Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 125(2), pages 222-238, September.
    5. Soma, Nei Yoshihiro & Toth, Paolo, 2002. "An exact algorithm for the subset sum problem," European Journal of Operational Research, Elsevier, vol. 136(1), pages 57-66, January.
    6. Nicholas G. Hall & Marc E. Posner, 2007. "Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures," Operations Research, INFORMS, vol. 55(4), pages 703-716, August.
    7. Yang Yang, 2024. "An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients," Mathematics, MDPI, vol. 12(12), pages 1-12, June.

    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:120:y:2000:i:2:p:289-296. 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.