IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v38y2019i3d10.1007_s10878-019-00423-z.html
   My bibliography  Save this article

A lower bound for online rectangle packing

Author

Listed:
  • Leah Epstein

    (University of Haifa)

Abstract

We slightly improve the known lower bound on the asymptotic competitive ratio for online bin packing of rectangles. We present a complete proof for the new lower bound, whose value is above 1.91.

Suggested Citation

  • Leah Epstein, 2019. "A lower bound for online rectangle packing," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 846-866, October.
    • Handle: RePEc:spr:jcomop:v:38:y:2019:i:3:d:10.1007_s10878-019-00423-z
    DOI: 10.1007/s10878-019-00423-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00423-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-019-00423-z?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.

    References listed on IDEAS

    as
    1. Hiroshi Fujiwara & Koji Kobayashi, 2015. "Improved lower bounds for the online bin packing problem with cardinality constraints," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 67-87, January.
    2. Csirik, J. & Frenk, J.B.G. & Labbé, M., 1993. "Two-dimensional rectangle packing: on-line methods and results," Econometric Institute Research Papers 11700, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. Xin Han & Deshi Ye & Yong Zhou, 2010. "A note on online hypercube packing," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 18(2), pages 221-239, June.
    4. Jian Yang & Joseph Y.-T. Leung, 2003. "The Ordered Open-End Bin-Packing Problem," Operations Research, INFORMS, vol. 51(5), pages 759-770, October.
    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. János Balogh & József Békési & György Dósa & Leah Epstein & Asaf Levin, 2022. "Lower bounds for batched bin packing," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 613-629, April.
    2. János Balogh & Leah Epstein & Asaf Levin, 2021. "More on ordered open end bin packing," Journal of Scheduling, Springer, vol. 24(6), pages 589-614, December.

    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. Paulina Grzegorek & Janusz Januszewski, 2019. "Drawer algorithms for 1-space bounded multidimensional hyperbox packing," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 1011-1044, April.
    2. Leung, Joseph Y.-T. & Li, Chung-Lun, 2008. "An asymptotic approximation scheme for the concave cost bin packing problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 582-586, December.
    3. Alberto Ceselli & Giovanni Righini, 2008. "An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem," Operations Research, INFORMS, vol. 56(2), pages 425-436, April.
    4. János Balogh & Leah Epstein & Asaf Levin, 2021. "More on ordered open end bin packing," Journal of Scheduling, Springer, vol. 24(6), pages 589-614, December.
    5. Yong Zhang & Francis Y. L. Chin & Hing-Fung Ting & Xin Han, 2013. "Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing," Journal of Combinatorial Optimization, Springer, vol. 26(2), pages 223-236, August.
    6. Guosong Yu & Yanling Mao & Jiaoliao Xiao, 2017. "A new upper bound for the online square packing problem in a strip," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1411-1420, May.

    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:jcomop:v:38:y:2019:i:3:d:10.1007_s10878-019-00423-z. 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: 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.