IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v57y2003i3p449-479.html
   My bibliography  Save this article

The average behaviour of greedy algorithms for the knapsack problem: General distributions

Author

Listed:
  • Gennady Diubin
  • Alexander Korbut

Abstract

The paper is a generalization of [4], [5] for arbitrary distributions of coefficients. It is supposed that the coefficients of the objective function and the constraint of the knapsack problem are independent identically distributed random variables having a density with support [0, 1], and the right-hand side of the constraint is proportional to the number of variables, i. e. b=λn. We establish a bound on λ (in terms of the given density and a parameter t > 0) ensuring that both the primal and the dual greedy algorithms have an asymptotic tolerance t. Copyright Springer-Verlag Berlin Heidelberg 2003

Suggested Citation

  • Gennady Diubin & Alexander Korbut, 2003. "The average behaviour of greedy algorithms for the knapsack problem: General distributions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 57(3), pages 449-479, August.
    • Handle: RePEc:spr:mathme:v:57:y:2003:i:3:p:449-479
    DOI: 10.1007/s001860200270
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860200270
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860200270?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
    ---><---

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

    Citations

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


    Cited by:

    1. Andrew Mastin & Patrick Jaillet, 2015. "Average-Case Performance of Rollout Algorithms for Knapsack Problems," Journal of Optimization Theory and Applications, Springer, vol. 165(3), pages 964-984, June.
    2. del Castillo, Enrique & Beretta, Alessia & Semeraro, Quirico, 2017. "Optimal setup of a multihead weighing machine," European Journal of Operational Research, Elsevier, vol. 259(1), pages 384-393.

    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:spr:mathme:v:57:y:2003:i:3:p:449-479. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.