| EXACT ALGORITHM FOR BIN COVERING |
| |
| 引用本文： | 陈峰,姚恩瑜. EXACT ALGORITHM FOR BIN COVERING[J]. Journal of Zhejiang University. Science. B, 2001, 0(3) |
| |
| 作者姓名： | 陈峰 姚恩瑜 |
| |
| 作者单位： | Department of Applied Mathematics，Zhejiang University，Hangzhou 310027，China |
| |
| 基金项目： | NaturalScienceFoundationofChina(NSFC) |
| |
| 摘 要： | ＩＮＴＲＯＤＵＣＴＩＯＮＴｈｅｂｉｎｃｏｖｅｒｉｎｇｐｒｏｂｌｅｍｃａｎｂｅｓｔａｔｅｄａｓｆｏｌｌｏｗｓ.Ｇｉｖｅｎｎｉｔｅｍｓｏｆｗｅｉｇｈｔｓｌ1 … ,ｌｎ ａｎｄａｎｕｎｌｉｍｉｔｅｄｎｕｍｂｅｒｏｆｉｄｅｎｔｉｃａｌｂｉｎｓｏｆｃａｐａｃｉｔｙＣ ,ｐａｃｋｔｈｅｉｔｅｍｓｉｎａｓｍａｎｙｂｉｎｓａｓｐｏｓｓｉｂｌｅｓｏｔｈａｔｔｈｅｔｏｔａｌｗｅｉｇｈｔｏｆｅａｃｈｂｉｎｉｓｎｏｌｅｓｓｔｈａｎｉｔｓｃａｐａｃｉｔｙ.Ｔｈｅｂｉｎｃｏｖｅｒｉｎｇｐｒｏｂｌｅｍｗａｓｆｉｒｓｔｓｔｕｄｉｅｄ…
|
EXACT ALGORITHM FOR BIN COVERING |
| |
| Abstract: | This paper presents a new arc flow model for the one|dimensional bin covering problem and an algorithm to solve the problem exactly through a branch|and|bound procedure and the technique of column generation. The subproblems occuring in the procedure of branch|and|bound have the same structure and therefore can be solved by the same algorithm. In order to solve effectively the subproblems which are generally large scale, a column generation algorithm is employed. Many rules found in this paper can improve the performance of the methods. |
| |
| Keywords: | bin covering column generation branch|and|bound algorithm |
| 本文献已被 CNKI 等数据库收录！ |
