节点文献
0—1整数规划求解一法
An Algorithm for Solving Zero-One Linear Programming
【摘要】 提出约束松紧的概念及对约束方程不可行解的粗筛,减少计算次数,对计算大型问题提供了有利条件。
【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.
- 【文献出处】 北京化工学院学报(自然科学版) , 编辑部邮箱 ,1989年03期
- 【被引频次】1
- 【下载频次】259