摘要
本文从理论到应用上,系统地提出了一个完整的解决0—1规划问题的新算法。其计算复杂性在某种统计意义下为O(m)。许多应用实例表明本算法是行之有效的,而且效果显著。
A new complete algorithm of 0-1 programming is proposed in theory and application in this paper. The complexity of calculation is O(m) in a specific statistics sense. A lot of applied examples have proved that the algorithm is highly effective.
出处
《系统工程学报》
CSCD
1990年第1期1-10,共10页
Journal of Systems Engineering
