KMS Of Academy of mathematics and systems sciences, CAS
The asymptotic worst-case behavior of the FFD heuristic for small items | |
Xu, KH | |
2000-11-01 | |
发表期刊 | JOURNAL OF ALGORITHMS
![]() |
ISSN | 0196-6774 |
卷号 | 37期号:2页码:237-246 |
摘要 | The First-Fit-Decreasing (FFD) algorithm is one of the most famous and most studied methods for an approximative solution of the bin-packing problem. The question on the parametric behavior of the FFD heuristic for small items was raised in D. S. Johnson's thesis (1973, MIT, Cambridge, MA) and in E. G. Coffman et al. (1987, SLAM J. Comput. 7, 1-17): what is the asymptotic worst-case ratio for FFD when restricted to lists with item sizes in the interval (0, alpha] for alpha less than or equal to 1/2. Let R-FFD(infinity)(alpha) denote the asymptotic worst-case ratio for these lists. In his thesis, Johnson gave the values of R-FFD(infinity)(alpha) for 8/29 < |
语种 | 英语 |
WOS研究方向 | Computer Science ; Mathematics ; Science & Technology - Other Topics |
WOS类目 | Computer Science, Theory & Methods ; Mathematics, Applied ; Logic |
WOS记录号 | WOS:000165183500001 |
出版者 | ACADEMIC PRESS INC |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | http://ir.amss.ac.cn/handle/2S8OKBNM/15551 |
专题 | 中国科学院数学与系统科学研究院 |
通讯作者 | Xu, KH |
作者单位 | 1.Texas A&M Univ, Dept Ind Engn, College Stn, TX 77843 USA 2.Acad Sinica, Inst Appl Math, Beijing 100080, Peoples R China |
推荐引用方式 GB/T 7714 | Xu, KH. The asymptotic worst-case behavior of the FFD heuristic for small items[J]. JOURNAL OF ALGORITHMS,2000,37(2):237-246. |
APA | Xu, KH.(2000).The asymptotic worst-case behavior of the FFD heuristic for small items.JOURNAL OF ALGORITHMS,37(2),237-246. |
MLA | Xu, KH."The asymptotic worst-case behavior of the FFD heuristic for small items".JOURNAL OF ALGORITHMS 37.2(2000):237-246. |
条目包含的文件 | 条目无相关文件。 |
个性服务 |
推荐该条目 |
保存到收藏夹 |
查看访问统计 |
导出为Endnote文件 |
谷歌学术 |
谷歌学术中相似的文章 |
[Xu, KH]的文章 |
百度学术 |
百度学术中相似的文章 |
[Xu, KH]的文章 |
必应学术 |
必应学术中相似的文章 |
[Xu, KH]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论