| 0—1型整数规划问题的求解方法 |
| |
| 引用本文： | 王平.0—1型整数规划问题的求解方法[J].太原科技大学学报,1991(3). |
| |
| 作者姓名： | 王平 |
| |
| 作者单位： | 太原重型机械学院图书馆 |
| |
| 摘 要： | 求解0—1型整数规划问题已经有许多较完善的方法,本文正是通过对这些方法的讨论和研究,提出一种新的求解方法,这种新方法对于求解较复杂的问题,非常有效。
|
| 关 键 词： | 0—1变量 整数规划 穷举法 隐枚举法 过滤条件 |
A Method to Solve the Problem in 0-1 Integer Programming |
| |
| Wang Ping.A Method to Solve the Problem in 0-1 Integer Programming[J].Journal of Taiyuan University of Science and Technology,1991(3). |
| |
| Authors: | Wang Ping |
| |
| Abstract: | There are a number of methods to solve the problems in 0-1 Jnleger Programming. Through studying all the methods, this paper presents, a new analytic method, which is very effective in solving the complicated problems. |
| |
| Keywords: | 0-1 variable integer programming exhaustive method implicit enumeration filtered condition |
| 本文献已被 CNKI 等数据库收录！ |
|
