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

On the bin packing problem with a fixed number of object weights

Author

Listed:
  • Filippi, Carlo

Abstract

No abstract is available for this item.

Suggested Citation

  • Filippi, Carlo, 2007. "On the bin packing problem with a fixed number of object weights," European Journal of Operational Research, Elsevier, vol. 181(1), pages 117-126, August.
  • Handle: RePEc:eee:ejores:v:181:y:2007:i:1:p:117-126
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00431-0
    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. Christoph Nitsche & Guntram Scheithauer & Johannes Terno, 1998. "New cases of the cutting stock problem having MIRUP," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 48(1), pages 105-115, September.
    2. Elhedhli, Samir, 2005. "Ranking lower bounds for the bin-packing problem," European Journal of Operational Research, Elsevier, vol. 160(1), pages 34-46, January.
    3. S. Thomas McCormick & Scott R. Smallwood & Frits C. R. Spieksma, 2001. "A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths," Mathematics of Operations Research, INFORMS, vol. 26(1), pages 31-49, 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. Klaus Jansen & Roberto Solis-Oba, 2011. "A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 743-753, November.

    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. N. Brauner & Y. Crama & A. Grigoriev & J. Klundert, 2005. "A Framework for the Complexity of High-Multiplicity Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 9(3), pages 313-323, May.
    2. Klaus Jansen & Roberto Solis-Oba, 2011. "A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 743-753, November.
    3. Bassem Jarboui & Saber Ibrahim & Abdelwaheb Rebai, 2010. "A new destructive bounding scheme for the bin packing problem," Annals of Operations Research, Springer, vol. 179(1), pages 187-202, September.
    4. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    5. Wagenaar, J.C. & Fragkos, I. & Faro, W.L.C., 2023. "Transportation asset acquisition under a newsvendor model with cutting-stock restrictions: Approximation and decomposition algorithms," Other publications TiSEM 97eddbd0-6e34-489c-b27d-9, Tilburg University, School of Economics and Management.
    6. Gianfranco Ciaschetti & Lorenzo Corsini & Paolo Detti & Giovanni Giambene, 2007. "Packet scheduling in third-generation mobile systems with UTRA-TDD air interface," Annals of Operations Research, Springer, vol. 150(1), pages 93-114, March.
    7. Goldberg, Noam & Karhi, Shlomo, 2017. "Packing into designated and multipurpose bins: A theoretical study and application to the cold chain," Omega, Elsevier, vol. 71(C), pages 85-92.
    8. Özlük, Özgür & Elimam, Abdelghani A. & Interaminense, Eduardo, 2010. "Optimum service capacity and demand management with price incentives," European Journal of Operational Research, Elsevier, vol. 204(2), pages 316-327, July.

    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:181:y:2007:i:1:p:117-126. 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.