| 0—1整数规划求解一法 |
| |
| 引用本文： | 陈忠实,蒋昱辰. 0—1整数规划求解一法[J]. 北京化工大学学报(自然科学版), 1989, 0(3) |
| |
| 作者姓名： | 陈忠实 蒋昱辰 |
| |
| 作者单位： | 北京化工学院工业管理工程系，北京化工学院工业管理工程系 87届毕业生 中国国际信托投资公司 |
| |
| 摘 要： | 提出约束松紧的概念及对约束方程不可行解的粗筛,减少计算次数,对计算大型问题提供了有利条件。
|
| 关 键 词： | 运筹学 整数规划 0-1规划 |
An Algorithm for Solving Zero-One Linear Programming |
| |
| Chen Zhongshi,Jiang Yuchen. An Algorithm for Solving Zero-One Linear Programming[J]. Journal of Beijing University of Chemical Technology, 1989, 0(3) |
| |
| Authors: | Chen Zhongshi Jiang Yuchen |
| |
| Affiliation: | Department of Management Engineering |
| |
| Abstract: | This article introduced a new concept of constraint-loose-tight degree and a method of rough-sieve of infeasible constraints. The operation time can be decreased with this method, especially for large scale zero-one linear programming problem. |
| |
| Keywords: | operations research integer programming zero-one programming |
| 本文献已被 CNKI 等数据库收录！ |
