An improved lower bound for the bin packing problem

被引：9
|
作者：
Chen, BT
Srivastava, B
机构：
[1] MARQUETTE UNIV,DEPT MANAGEMENT,MILWAUKEE,WI 53201
[2] WASHINGTON STATE UNIV,COLL BUSINESS & ECON,DEPT MANAGEMENT & SYST,PULLMAN,WA 99164
来源：
DISCRETE APPLIED MATHEMATICS | 1996年 / 66卷 / 01期
关键词：
bin packing problem; lower bound; worst-case analysis;
D O I：
10.1016/0166-218X(96)80459-8
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This paper unifies and generalizes the existing lower bounds for the one-dimensional bin packing problem. The generalization is motivated by and based on the work of Martello and Toth (this journal, 1990), The worst-case performance of the unified lower bound is analyzed and two new lower bounds are proposed and compared with existing lower bounds through numerical experiments.
引用
收藏
页码：81 / 94
页数：14
相关论文
共 50 条
  • [21] LOWER BOUNDS AND REDUCTION PROCEDURES FOR THE BIN PACKING PROBLEM
    MARTELLO, S
    TOTH, P
    [J]. DISCRETE APPLIED MATHEMATICS, 1990, 28 (01) : 59 - 70
  • [22] Ranking lower bounds for the bin-packing problem
    Elhedhli, S
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 160 (01) : 34 - 46
  • [23] Heuristics and lower bounds for the bin packing problem with conflicts
    Gendreau, M
    Laporte, G
    Semet, F
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (03) : 347 - 358
  • [24] A new lower bound for the non-oriented two-dimensional bin-packing problem
    Clautiaux, Francois
    Jouglet, Antoine
    El Hayek, Joseph
    [J]. OPERATIONS RESEARCH LETTERS, 2007, 35 (03) : 365 - 373
  • [25] Improved Lower Bound for Online Strip Packing
    Rolf Harren
    Walter Kern
    [J]. Theory of Computing Systems, 2015, 56 : 41 - 72
  • [26] Improved Lower Bound for Online Strip Packing
    Harren, Rolf
    Kern, Walter
    [J]. THEORY OF COMPUTING SYSTEMS, 2015, 56 (01) : 41 - 72
  • [27] Lower bounds for a bin packing problem with linear usage cost
    Braune, Roland
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (01) : 49 - 64
  • [28] Lower and upper bounds for the Bin Packing Problem with Fragile Objects
    Clautiaux, Francois
    Dell'Amico, Mauro
    Iori, Manuel
    Khanafer, Ali
    [J]. DISCRETE APPLIED MATHEMATICS, 2014, 163 : 73 - 86
  • [29] 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
  • [30] Improved lower bounds for semi-online bin packing problems
    Balogh, Janos
    Bekesi, Jozsef
    Galambos, Gabor
    Markot, Mihaly Csaba
    [J]. COMPUTING, 2009, 84 (1-2) : 139 - 148
12345