| Online bin packing problem with buffer and bounded size revisited | |
| Zhang, Minghui; Han, Xin; Lan, Yan; Ting, Hing-Fung | |
| 刊名 | JOURNAL OF COMBINATORIAL OPTIMIZATION
 |
| 2017 | |
| 卷号 | 33页码:530-542 |
| 关键词 | Bin packing Online algorithm Asymptotic competitive ratio |
| ISSN号 | 1382-6905 |
| URL标识 | 查看原文 |
| WOS记录号 | [DB:DC_IDENTIFIER_WOSID] |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/3281873 |
| 专题 | 大连理工大学 |
| 作者单位 | 1.Dalian Univ Technol, Sch Software Technol, Dalian 116620, Peoples R China. 2.Dalian Neusoft Univ Informat, Software Engn Dept, Dalian 116023, Peoples R China. 3.Dalian Univ Technol, Sch Software Technol, Dalian 116620, Peoples R China. 4.Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China. |
| 推荐引用方式 GB/T 7714 | Zhang, Minghui,Han, Xin,Lan, Yan,et al. Online bin packing problem with buffer and bounded size revisited[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2017,33:530-542. |
| APA | Zhang, Minghui,Han, Xin,Lan, Yan,&Ting, Hing-Fung.(2017).Online bin packing problem with buffer and bounded size revisited.JOURNAL OF COMBINATORIAL OPTIMIZATION,33,530-542. |
| MLA | Zhang, Minghui,et al."Online bin packing problem with buffer and bounded size revisited".JOURNAL OF COMBINATORIAL OPTIMIZATION 33(2017):530-542. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论