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 条
  • [1] AN IMPROVED LOWER BOUND FOR ONLINE BIN PACKING ALGORITHMS
    VANVLIET, A
    [J]. INFORMATION PROCESSING LETTERS, 1992, 43 (05) : 277 - 284
  • [2] An analysis of lower bound procedures for the bin packing problem
    Bourjolly, JM
    Rebetez, V
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (03) : 395 - 405
  • [3] Lower bound for the online bin packing problem with restricted repacking
    Balogh, Janos
    Bekesi, Jozsef
    Galambos, Gabor
    Reinelt, Gerhard
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 38 (01) : 398 - 410
  • [4] A LOWER BOUND FOR ONLINE BIN PACKING
    LIANG, FM
    [J]. INFORMATION PROCESSING LETTERS, 1980, 10 (02) : 76 - 79
  • [5] On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
    Joseph Wun-Tat Chan
    Prudence W. H. Wong
    Fencol C. C. Yung
    [J]. Algorithmica, 2009, 53 : 172 - 206
  • [6] On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
    Chan, Joseph Wun-Tat
    Wong, Prudence W. H.
    Yung, Fencol C. C.
    [J]. ALGORITHMICA, 2009, 53 (02) : 172 - 206
  • [7] On dynamic bin packing: An improved lower bound and resource augmentation analysis
    Chan, Wun-Tat
    Wong, Prudence W. H.
    Yung, Fencol C. C.
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 309 - 319
  • [8] 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
  • [9] 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
  • [10] A tight lower bound for optimal bin packing
    Chao, HY
    Harper, MP
    Quong, RW
    [J]. OPERATIONS RESEARCH LETTERS, 1995, 18 (03) : 133 - 138
12345