|
|||||
|
|
| 带核的装箱问题 | |
| 引用本文： | 唐少芳. 带核的装箱问题[J]. 杭州师范学院学报(自然科学版), 1999, 0(6) |
| 作者姓名： | 唐少芳 |
| 作者单位： | 杭州师范学院数学系 浙江杭州，310012 |
| 摘 要： | 本文研究带核的装箱问题，提出了一个近似算法──RFFD算法，给出了界的估计：对任何实的L，均有RFFD |
| 关 键 词： | 核元 权函数 最小反例 弥补空间 空余时间 |
The problem of kerneled bin picking |
|
| TANG Shao - fang. The problem of kerneled bin picking[J]. Journal of Hangzhou Teachers College(Natural Science), 1999, 0(6) | |
| Authors: | TANG Shao - fang |
| Abstract: | The bin packing problem is one of the best - known and most widely studied problems of combinatorial optimization. It plays an important role in many practical applications such as storing and packing. In this paper, a special bin packing problem-kerneled bin packing is discussed. We produce an approximation algorithm-FFD algorithm and prove that it guarantees a worst - case bound of . |
| Keywords: | bin-packing kerneled item weighting function minimal counter-example supernumerary empty space shortage space |
| 本文献已被 CNKI 等数据库收录！ | |