| 0-1型整数规划解法刍议 |
| |
| 引用本文： | 李忠卫,冯丽娟,王希云. 0-1型整数规划解法刍议[J]. 太原科技大学学报, 2004, 25(4): 311-312 |
| |
| 作者姓名： | 李忠卫 冯丽娟 王希云 |
| |
| 作者单位： | 太原科技大学,太原,030024 |
| |
| 摘 要： | 用穷举法和隐枚举法解0-1型整数规划问题时,常常遇到组合爆炸问题。本文从约束条件入手直接给出某些变量的值,从而将减少了运算次数有效的改善了这一问题。
|
| 关 键 词： | 0-1型整数规划 隐枚举法 组合爆炸 |
| 文章编号： | 1000-159X(2004)04-0311-03 |
| 修稿时间： | 2003-06-02 |
A New Algorithm for 0-1 Integer Programming |
| |
| LI Zhong-wei,FENG Li-juan,WANG Xi-yun. A New Algorithm for 0-1 Integer Programming[J]. Journal of Taiyuan University of Science and Technology, 2004, 25(4): 311-312 |
| |
| Authors: | LI Zhong-wei FENG Li-juan WANG Xi-yun |
| |
| Abstract: | The combination explosion problem is common in solving 0-1 integer programming with enumeration and implicit enumeration ways. In this paper, a new algorithm to solve 0-1 integer programming is present by analyzing restrictive conditions. The algorithm gets the operation times reduced and makes the problem better solved. |
| |
| Keywords: | 0-1 integer programming implicit enumeration combination explosion |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
