A note on a variant of the online open end bin packing problem-Reference-Cited by-同舟云学术

A note on a variant of the online open end bin packing problem

Published:2020-11 Issue:6 Volume:48 Page:844-849
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Epstein Leah,Levin Asaf

Funder

ISF - Israel Science Foundation

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference26 articles.

1. J. Balogh, J. Békési, G. Dósa, L. Epstein, A. Levin, A new and improved algorithm for online bin packing, in: Proc. of the 26th European Symposium on Algorithms (ESA2018), 2018, pp. 5:1–5:14.

2. J. Balogh, J. Békési, G. Dósa, L. Epstein, A. Levin, A new lower bound for classic online bin packing, in: Proc. of the 17th Workshop on Approximation and Online Algorithms (WAOA2019), 2019, pp. 18–28.

3. New lower bounds for certain classes of bin packing algorithms;Balogh;Theoret. Comput. Sci.,2012

4. More on ordered open end bin packing;Balogh,2020

5. Bounds for online bin packing with cardinality constraints;Békési;Inform. and Comput.,2016

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tighter bounds for the harmonic bin packing algorithm;European Journal of Operational Research;2024-07

2. Competitive Analysis of the Online Leasing Problem for Scarce Resources;International Journal of Environmental Research and Public Health;2023-01-03

3. Open-end bin packing: New and old analysis approaches;Discrete Applied Mathematics;2022-11

4. Homogeneous grouping of non-prime steel products for online auctions: a case study;Annals of Operations Research;2022-04-05

5. More on ordered open end bin packing;Journal of Scheduling;2021-11-04