| 解（0,1）型整数规划的一种方法 |
| |
| 引用本文： | 施强. 解（0,1）型整数规划的一种方法[J]. 安徽工学院学报, 1992, 11(4): 48-53 |
| |
| 作者姓名： | 施强 |
| |
| 作者单位： | 安徽工学院基础部 合肥 |
| |
| 摘 要： | 对文献[1]《0-1型整数规划问题的求解方法》进行了剖析,并通过反例论,认为该文计算方法不可行。本文提出的一种解(0,1)型整数规划的计算方法,经算例计算表明,本文方法有效。
|
| 关 键 词： | 整数规划 跳跃检索 |
A METHOD SOLVING THE PROBLEM ABOUT ZERO-ONF INTEGER PROGRAMMING |
| |
| Xu Qiang Basic Courses Department. A METHOD SOLVING THE PROBLEM ABOUT ZERO-ONF INTEGER PROGRAMMING[J]. , 1992, 11(4): 48-53 |
| |
| Authors: | Xu Qiang Basic Courses Department |
| |
| Affiliation: | Xu Qiang Basic Courses Department |
| |
| Abstract: | In this paper, the analytic mothod of the thesis[1] is analysedIt is regarded impossible, and the example is given to grove it. The paper presentsa new algorithm. Some numerical results show that it is very effective. |
| |
| Keywords: | 0-1 variables integer programming rhe seeking with jumping |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
