Approximation algorithms for a hierarchically structured bin packing problem

被引：11

作者：

Codenotti, B

De Marco, G

Leoncini, M

Montangero, M ^{[1
]}

Santini, M

机构：

[1] CNR, Ist Informat & Telemat, I-56100 Pisa, Italy

[2] Univ Modena, Dipartimento Sci Sociali Cognit & Quantitat, I-41100 Modena, Italy

[3] Univ Iowa, Dept Comp Sci, Iowa City, IA 52242 USA

来源：

INFORMATION PROCESSING LETTERS | 2004年 / 89卷 / 05期

关键词：

algorithms; approximation algorithms; bin packing; NP-hardness;

D O I：

10.1016/j.ipl.2003.12.001

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper we study a variant of the bin packing problem in which the items to be packed are structured as the leaves of a tree. The problem is motivated by document organization and retrieval. We show that the problem is NP-hard and we give approximation algorithms for the general case and for the particular case in which all the items have the same size. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：215 / 221

页数：7

共 50 条

[41] Approximation Algorithms for Interdiction Problem with Packing Constraints
Chen, Lin
Wu, Xiaoyu
Zhang, Guochuan
arXiv, 2022,
[42] Approximation Algorithms for Drone Delivery Packing Problem
Jana, Saswata
Mandal, Partha Sarathi
PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING, ICDCN 2023, 2023, : 262 - 269
[43] NEW ALGORITHMS FOR BIN PACKING
YAO, ACC
JOURNAL OF THE ACM, 1980, 27 (02) : 207 - 227
[44] MULTIDIMENSIONAL BIN PACKING ALGORITHMS
KOU, LT
MARKOWSKY, G
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1977, 21 (05) : 443 - 448
[45] FAST ALGORITHMS FOR BIN PACKING
JOHNSON, DS
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 8 (03) : 272 - 314
[46] Algorithms for the variable-sized bin packing problem with time windows
Liu, Qiang
Cheng, Huibing
Tian, Tian
Wang, Yongsheng
Leng, Jiewu
Zhao, Rongli
Zhang, Hao
Wei, Lijun
COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 155
[47] Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
Mehrani, Saharnaz
Cardonha, Carlos
Bergman, David
INFORMS JOURNAL ON COMPUTING, 2022, 34 (02) : 1070 - 1085
[48] Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation
Barkel, Mathijs
Delorme, Maxence
Malaguti, Enrico
Monaci, Michele
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2025, 320 (01) : 57 - 68
[49] EXPERIMENTAL COMPARISON OF BASIC AND CARDINALITY CONSTRAINED BIN PACKING PROBLEM ALGORITHMS
Remic, Maja
Zerovnik, Gasper
Zerovnik, Janez
SOR'11 PROCEEDINGS: THE 11TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH IN SLOVENIA, 2011, : 109 - 114
[50] Efficient algorithms for the offline variable sized bin-packing problem
Maiza, Mohamed
Labed, Abdenour
Radjef, Mohammed Said
JOURNAL OF GLOBAL OPTIMIZATION, 2013, 57 (03) : 1025 - 1038

← 1 2 3 4 5 →