搜索结果: 1-1 共查到“应用数学 FFD algorithm”相关记录1条 . 查询时间(0.062 秒)
For the bin-packing FFD algorithm we give a.proof of FFD (L) ≤■ OPT (L) +■. The best bound before was FFD (L)≤■ OPT (L) +1 given by Yue Minyi.