|
|||||
|
|
| THE FFD ALGORITHM FOR THE BIN PACKING PROBLEM WITH KERNEL ITEMS | |
| 引用本文： | ZHANGGUOCHUAN YAOENYU. THE FFD ALGORITHM FOR THE BIN PACKING PROBLEM WITH KERNEL ITEMS[J]. 高校应用数学学报(英文版), 1998, 13(3): 335-340. DOI: 10.1007/s11766-998-0027-1 |
| 作者姓名： | ZHANGGUOCHUAN YAOENYU |
| 作者单位： | DepartmentofAppliedMathematics，ZhejiangUniversity,Hangzhou310027 |
| 摘 要： | The FFD algorithm is one of the most famous algorithms for the classical bin packing problem. In this paper,some versions of the FFD algorithm are considered in several bin packing problems. Especially,two of them applied to the bin packing problem with kernel items are analyzed. Tight worst-case performance ratios are obtained. |
| 关 键 词： | FFD算法 二进制储存 核项目 性能比率 |
| 收稿时间： | 1997-03-31 |
The FFD algorithm for the bin packing problem with kernel items |
|
| Zhang Guochuan,Yao Enyu. The FFD algorithm for the bin packing problem with kernel items[J]. Applied Mathematics A Journal of Chinese Universities, 1998, 13(3): 335-340. DOI: 10.1007/s11766-998-0027-1 | |
| Authors: | Zhang Guochuan Yao Enyu |
| Affiliation: | (1) Department of Applied Mathematics, Zhejiang University, 310027 Hangzhou |
| Abstract: | The FFD algorithm is one of the most famous algorithms for the classical bin packing problem. In this paper, some versions of the FFD algorithm are considered in several bin packing problems. Especially, two of them applied to the bin packing problem with kernel items are analyzed. Tight worst-case performance ratios are obtained. This work has been supported by China Postdoctoral Science Foundation and a Science Foundation under the Ministry of Education. |
| Keywords: | 90B35 90C27 |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ | |