• 论文 • 上一篇    下一篇

0-1运输型问题

尉继英   

  1. 财政部计算中心
  • 出版日期:1992-02-20 发布日期:1992-02-20

尉继英. 0-1运输型问题[J]. 数值计算与计算机应用, 1992, 13(2): 119-130.

ON THE 0-1 TRANSPORTATION PROBLEM

  1. Yu Ji-ying Computiag Centre, Ministry of Finance P. R. C.
  • Online:1992-02-20 Published:1992-02-20
0-1运输型问题是一类特殊的0-1整数规划.虽然求解0-1整数规划的方法已有许多,但是它们都有一个共同的弱点:运算量大,存贮量大.对0-1运输型问题用传统的办法求解,效率很低.为此,我们必须对0-1运输型问题进行专门研究,寻找有效算法.
Although rounding off balance (ROB), an important application of 0-1 transportation,has been used in finance, statistic and planning departments. At national and local levels, al-most all ROB jobs are completed by artificial computation, which is usually based upon humanexperience. It is necessary to study an efficient algorithm for solving ROB problems. To thisend, some theoretical problems on 0-1 transportation problems are discussed in this paper. AStrict mathematical method is used to discuss ROB problems.
()

[1] 赵凤冶,多品种容量运输问题的位势法,计算数学,4:4,(1982) 。
[2] 中国统计年鉴,(1988) .
No related articles found!
阅读次数
全文


摘要