IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v29y1982i1p119-145.html
   My bibliography  Save this article

On a generalized bin‐packing problem

Author

Listed:
  • R. T. Lewis
  • R. G. Parker

Abstract

In this paper we address a bin‐packing problem which possesses a variety of modifications of the classic theme. Among these are bin‐dependent chip weights, bin costs, and bin‐dependent penalties for unused capacity. Lagrangian relaxations are employed in the context of a branch‐and‐bound framework in order to solve the problem after which substantial computational experience is provided.

Suggested Citation

  • R. T. Lewis & R. G. Parker, 1982. "On a generalized bin‐packing problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 29(1), pages 119-145, March.
    • Handle: RePEc:wly:navlog:v:29:y:1982:i:1:p:119-145
    DOI: 10.1002/nav.3800290112
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800290112
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800290112?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. Braune, Roland, 2019. "Lower bounds for a bin packing problem with linear usage cost," European Journal of Operational Research, Elsevier, vol. 274(1), pages 49-64.

    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:wly:navlog:v:29:y:1982:i:1:p:119-145. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.