Improved lower bounds for semi-online bin packing problems

被引：4
|
作者：
Balogh, Janos [3 ]
Bekesi, Jozsef [3 ]
Galambos, Gabor [3 ]
Markot, Mihaly Csaba [1 ,2 ]
机构：
[1] Univ Vienna, Fac Math, A-1090 Vienna, Austria
[2] European Space Agcy, Estec, Adv Concepts Team, Noordwijk, Netherlands
[3] Univ Szeged, Dept Informat Applicat, Gyula Juhasz Fac Educ, H-6725 Szeged, Hungary
来源：
COMPUTING | 2009年 / 84卷 / 1-2期
基金：
奥地利科学基金会;
关键词：
Semi-online bin packing problems; Nonlinear optimization; Branch-and-bound; Interval arithmetic;
D O I：
10.1007/s00607-008-0023-6
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In the paper we deal with lower bounds constructed for the asymptotic competitive ratio of semi-online bin packing and batched bin packing algorithms.We determine the bounds as the solutions of a related nonlinear optimization problem using theoretical analysis and a reliable numerical global optimization method. Our results improve the lower bounds given in Gutin et al. (Discrete Optim 2:71-82, 2005) for some special cases of the batched bin packing problem.
引用
收藏
页码：139 / 148
页数：10
相关论文
共 50 条
  • [31] Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
    György Dósa
    Armin Fügenschuh
    Zhiyi Tan
    Zsolt Tuza
    Krzysztof Węsek
    Central European Journal of Operations Research, 2019, 27 : 1107 - 1130
  • [32] Heuristics and lower bounds for the bin packing problem with conflicts
    Gendreau, M
    Laporte, G
    Semet, F
    COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (03) : 347 - 358
  • [33] Ranking lower bounds for the bin-packing problem
    Elhedhli, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 160 (01) : 34 - 46
  • [34] LOWER BOUNDS AND REDUCTION PROCEDURES FOR THE BIN PACKING PROBLEM
    MARTELLO, S
    TOTH, P
    DISCRETE APPLIED MATHEMATICS, 1990, 28 (01) : 59 - 70
  • [35] Comparing online algorithms for bin packing problems
    Leah Epstein
    Lene M. Favrholdt
    Jens S. Kohrt
    Journal of Scheduling, 2012, 15 : 13 - 21
  • [36] An improved lower bound for the bin packing problem
    Chen, BT
    Srivastava, B
    DISCRETE APPLIED MATHEMATICS, 1996, 66 (01) : 81 - 94
  • [37] Comparing online algorithms for bin packing problems
    Epstein, Leah
    Favrholdt, Lene M.
    Kohrt, Jens S.
    JOURNAL OF SCHEDULING, 2012, 15 (01) : 13 - 21
  • [38] New bounds for variable-sized online bin packing
    Seiden, SS
    Van Stee, R
    Epstein, L
    SIAM JOURNAL ON COMPUTING, 2003, 32 (02) : 455 - 469
  • [39] New Lower Bounds for Certain Classes of Bin Packing Algorithms
    Balogh, Janos
    Bekesi, Jozsef
    Galambos, Gabor
    APPROXIMATION AND ONLINE ALGORITHMS, 2011, 6534 : 25 - 36
  • [40] Upper and lower bounds for the optimum in a temporal bin packing problem
    Kochetov, Yu. A.
    Ratushnyi, A., V
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2024, 30 (01): : 109 - 127
12345