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 条
  • [1] Improved lower bounds for semi-online bin packing problems
    János Balogh
    József Békési
    Gábor Galambos
    Mihály Csaba Markót
    Computing, 2009, 84 : 139 - 148
  • [2] Online LIB problems: Heuristics for bin covering and lower bounds for bin packing
    Finlay, L
    Manyem, P
    RAIRO-OPERATIONS RESEARCH, 2005, 39 (03) : 163 - 183
  • [3] Resource augmented semi-online bounded space bin packing
    Epstein, Leah
    Kleiman, Elena
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (13) : 2785 - 2798
  • [4] Improved lower bounds for the online bin packing problem with cardinality constraints
    Fujiwara, Hiroshi
    Kobayashi, Koji
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 29 (01) : 67 - 87
  • [5] Improved lower bounds for the online bin packing problem with cardinality constraints
    Hiroshi Fujiwara
    Koji Kobayashi
    Journal of Combinatorial Optimization, 2015, 29 : 67 - 87
  • [6] Colored Bin Packing: Online Algorithms and Lower Bounds
    Bohm, Martin
    Dosa, Gyorgy
    Epstein, Leah
    Sgall, Jiri
    Vesely, Pavel
    ALGORITHMICA, 2018, 80 (01) : 155 - 184
  • [7] Colored Bin Packing: Online Algorithms and Lower Bounds
    Martin Böhm
    György Dósa
    Leah Epstein
    Jiří Sgall
    Pavel Veselý
    Algorithmica, 2018, 80 : 155 - 184
  • [8] Lower Bounds for Several Online Variants of Bin Packing
    János Balogh
    József Békési
    György Dósa
    Leah Epstein
    Asaf Levin
    Theory of Computing Systems, 2019, 63 : 1757 - 1780
  • [9] Lower Bounds for Several Online Variants of Bin Packing
    Balogh, Janos
    Bekesi, Jozsef
    Dosa, Gyoergy
    Epstein, Leah
    Levin, Asaf
    THEORY OF COMPUTING SYSTEMS, 2019, 63 (08) : 1757 - 1780
  • [10] New classes of lower bounds for bin packing problems
    Fekete, SP
    Schepers, J
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 257 - 270
12345