科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this article, we propose a discrete algorithm that can be used to solve transport-type problems. The real improvement brought by applying this original algorithm consists in obtaining a completely filtered and kind of optimal program, following a small number of steps, comparing with other existing algorithms. The outcome will be that the computer memory and the implementation costs will be reduced. The solution is based upon combinatorial methods, and it addresses a certain transport capacity X that is bounded both above and below(d <= X <= D). As a concrete example, we also present a (n, m) = (3,3) numerical application corresponding to a situation of 3 suppliers and 3 of their beneficiaries.
- 出版日期2013
