A SIMPLE PROOF OF LIANG LOWER BOUND FOR ONLINE BIN PACKING AND THE EXTENSION TO THE PARAMETRIC CASE

被引：6
|
作者：
GALAMBOS, G [1 ]
FRENK, JBG [1 ]
机构：
[1] ERASMUS UNIV,INST ECONOMETR,3000 DR ROTTERDAM,NETHERLANDS
来源：
DISCRETE APPLIED MATHEMATICS | 1993年 / 41卷 / 02期
关键词：
D O I：
10.1016/0166-218X(93)90037-O
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this note we present a simplified proof of a lower bound for on-line bin packing. This proof also covers the well-known result given by Liang in Inform. Process Lett. 10 (1980) 76-79.
引用
收藏
页码：173 / 178
页数：6
相关论文
共 50 条
  • [31] Improved lower bounds for the online bin packing problem with cardinality constraints
    Fujiwara, Hiroshi
    Kobayashi, Koji
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 29 (01) : 67 - 87
  • [32] Analysis of Lower Bounds for Online Bin Packing with Two Item Sizes
    Fujiwara, Hiroshi
    Endo, Ken
    Yamamoto, Hiroaki
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2021, E104A (09) : 1127 - 1133
  • [33] 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
    [J]. Computing, 2009, 84 : 139 - 148
  • [34] Improved lower bounds for the online bin packing problem with cardinality constraints
    Hiroshi Fujiwara
    Koji Kobayashi
    [J]. Journal of Combinatorial Optimization, 2015, 29 : 67 - 87
  • [35] A New Upper Bound 2.5545 on 2D Online Bin Packing
    Han, Xin
    Chin, Francis Y. L.
    Ting, Hing-Fung
    Zhang, Guochuan
    Zhang, Yong
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2011, 7 (04)
  • [36] SOLUTION OF BIN PACKING PROBLEM WITH WEIGHTED ANNEALING METHOD BASED ON LOWER BOUND
    Inak, Neriman
    Tokat, Sezai
    Karagul, Kenan
    [J]. JOURNAL OF MEHMET AKIF ERSOY UNIVERSITY ECONOMICS AND ADMINISTRATIVE SCIENCES FACULTY, 2018, 5 (03): : 549 - 567
  • [37] Semi-on-line bin packing: a short overview and a new lower bound
    Balogh, Janos
    Bekesi, Jozsef
    [J]. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2013, 21 (04) : 685 - 698
  • [38] Semi-on-line bin packing: a short overview and a new lower bound
    János Balogh
    József Békési
    [J]. Central European Journal of Operations Research, 2013, 21 : 685 - 698
  • [39] A simple proof of the uniform consensus synchronous lower bound
    Keidar, I
    Rajsbaum, S
    [J]. INFORMATION PROCESSING LETTERS, 2003, 85 (01) : 47 - 52
  • [40] A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case
    Baazaoui, Mariem
    Hanafi, Said
    Kamoun, Hichem
    [J]. 2014 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2014, : 219 - 224
12345