BIN-PACKING

作品数:3被引量:4H指数:2
导出分析报告
相关领域:理学更多>>
相关机构:浙江大学更多>>
相关期刊:《Journal of Systems Engineering and Electronics》《Acta Mathematicae Applicatae Sinica》《Science Bulletin》更多>>
相关基金:国家自然科学基金教育部“优秀青年教师资助计划”更多>>
-

检索结果分析

结果分析中...
条 记 录,以下是1-3
视图:
排序:
Non standard pallet series designing problem in ammunition supply system被引量:2
《Journal of Systems Engineering and Electronics》2005年第1期74-77,共4页LiLiangchun GuoMin WangHongwei 
ThisprojectwassupportedbytheNationalNaturalScienceFoundationofChina(70171015),theTeachingandResearchAwardFundforOutstandingYoungTeachersinHigherEducationInstitutionsofMOE,theExcellentYoungTeachersFundofMOE;andtheProjectofSupportingtheBackboneTeachersinHigherEducationInstitutionsofMOE.
According to the compound packing problem in ammunition supply system in our army, the non-standard pallet series design model is proposed, and the original problem that can be solved as a set cover problem with a nes...
关键词:ammunition supply PALLET minimum set covering bin-packing. 
The proof of FFD(L)≤11/9OPT(L) +7/9被引量:2
《Chinese Science Bulletin》1997年第15期1262-1265,共4页LI Rongheng, YUE Minyi1. Department of Mathematics, Hunan Normal University, Changsha 410081, China 2. Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China 
THE one-dimensional bin-packing problem is defined as follows: for a given list L={p1, p2,…, Pn}, where 0<pi≤1 denotes the item and its size as well, we are to pack all...
关键词:BIN-PACKING MINIMAL counter-example weigtht-function FFD-algorithm. 
A SIMPLE PROOF OF THE INEQUALITY MFFD(L)≤(71/60)OPT(L)+1,L FOR THE MFFD BIN-PACKING ALGORITHM
《Acta Mathematicae Applicatae Sinica》1995年第3期318-330,共13页越民义 张雷 
In 1985, Johnson and Garey[4] devised an algorithm which they call MFFD. Compared with other modifications of the famous FFD algorithm, theirs is apparently simpler in practical applications and substantially improves...
关键词:BIN-PACKING MFFD 
检索报告 对象比较 聚类工具 使用帮助 返回顶部