| 最小基数箱子覆盖问题 |
| |
| 引用本文： | 屈红文. 最小基数箱子覆盖问题[J]. 河南教育学院学报(自然科学版), 2009, 18(4): 1-2. DOI: 10.3969/j.issn.1007-0834.2009.04.001 |
| |
| 作者姓名： | 屈红文 |
| |
| 作者单位： | 河南工业大学理学院,河南郑州,450052 |
| |
| 摘 要： | 最小基数箱子覆盖问题,是在物件大小满足一定的条件下的装箱问题．给出了一个时间复杂度为O（n）的启发式算法．
|
| 关 键 词： | 装箱问题 启发式算法 覆盖 |
The Minimum Cardinality Bin Covering Problem |
| |
| QU Hongwen. The Minimum Cardinality Bin Covering Problem[J]. Journal of Henan Education Institute(Natural Science Edition), 2009, 18(4): 1-2. DOI: 10.3969/j.issn.1007-0834.2009.04.001 |
| |
| Authors: | QU Hongwen |
| |
| Affiliation: | QU Hongwen(College of Science,Henen University of Technology,Zhengzhou 450052,China) |
| |
| Abstract: | The minimum cardinality bin covering problem(MCBCP) is the problem that the size of the object meets certain conditions.Gives a heuristic algorithm and its time complexity is O(n). |
| |
| Keywords: | bin covering problem heuristic algorithm covering |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
