摘要
对文献[1]《0-1型整数规划问题的求解方法》进行了剖析,并通过反例论,认为该文计算方法不可行。本文提出的一种解(0,1)型整数规划的计算方法,经算例计算表明,本文方法有效。
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.
关键词
整数规划
跳跃检索
0-1 variables
integer programming
rhe seeking with jumping
