摘要
本文提出了一类可分解的０─１规划算法。与常用的０─１规划相比，此算法有很多优越性，这些优越性通过仿真得以验证。最后，用此算法解决一种资源分配问题。
In this pater a decomposition algorithm for a kind fo 0-1 programming is developed. By means of simulation the advantages of this algorithm compared with the conventional algorithm has been proved. An application of the algorithm to a resource allocation problem is also presented.
出处
《管理工程学报》
CSSCI
1995年第1期40-46,共7页
Journal of Industrial Engineering and Engineering Management
关键词
分解算法
0-1规划
资源分配
线性规划
A decomposition algorithm
0-1 programming
Resource allocation.
