摘要
求解0—1型整数规划问题已经有许多较完善的方法,本文正是通过对这些方法的讨论和研究,提出一种新的求解方法,这种新方法对于求解较复杂的问题,非常有效。
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.
出处
《太原重型机械学院学报》
1991年第3期21-25,共5页
Journal of Taiyuan Heavy Machinery Institute
关键词
整数规划
穷举法
隐救举法
0-1变量
0-1 variable, integer programming, exhaustive method, implicit enumeration, filtered condition
