LOWER BOUNDS AND REDUCTION PROCEDURES FOR THE BIN PACKING PROBLEM

被引：173
|
作者：
MARTELLO, S
TOTH, P
机构：
[1] DEIS-University of Bologna, 40136 Bologna
来源：
DISCRETE APPLIED MATHEMATICS | 1990年 / 28卷 / 01期
关键词：
Bin packing problem; dominance criterion; lower bound; reduction algorithm; worst-case performance;
D O I：
10.1016/0166-218X(90)90094-S
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The bin packing problem, in which a set of items of various sizes has to be packed into a minimum number of identical bins, has been extensively studied during the past fifteen years, mainly with the aim of finding fast heuristic algorithms to provide good approximate solutions. We present lower bounds and a dominance criterion and derive a reduction algorithm. Lower bounds are evaluated through an extension of the concept of worst-case performance. For both lower bounds and reduction algorithm an experimental analysis is provided. © 1990.
引用
收藏
页码：59 / 70
页数：12
相关论文
共 50 条
  • [1] New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
    Carlier, Jacques
    Clautiaux, Francois
    Moukrim, Aziz
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (08) : 2223 - 2250
  • [2] Ranking lower bounds for the bin-packing problem
    Elhedhli, S
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 160 (01) : 34 - 46
  • [3] 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
  • [4] An analysis of lower bound procedures for the bin packing problem
    Bourjolly, JM
    Rebetez, V
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (03) : 395 - 405
  • [5] Lower bounds for a bin packing problem with linear usage cost
    Braune, Roland
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (01) : 49 - 64
  • [6] 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
  • [7] Lower bounds for batched bin packing
    Balogh, Janos
    Bekesi, Jozsef
    Dosa, Gyorgy
    Epstein, Leah
    Levin, Asaf
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 43 (03) : 613 - 629
  • [8] Lower bounds for batched bin packing
    János Balogh
    József Békési
    György Dósa
    Leah Epstein
    Asaf Levin
    [J]. Journal of Combinatorial Optimization, 2022, 43 : 613 - 629
  • [9] 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
  • [10] 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
12345