| 摘要: |
| 给出符号差类运输问题的一个多项式时间算法,并证明该算法的时间复杂性是O(mn2+m2n). |
| 关键词: 运输问题 符号差 多项式时间算法 |
| DOI： |
| 投稿时间：1998-06-24修订日期：1998-07-14 |
| 基金项目:广西区科委攻关项目资助。 |
|
| Polynomial-time Algorithm for Signature Class Transportation Problem |
|
He Dengxu, Dai Zhenjie
|
| (Dept of Math. & Comp Sci., Guangxi Univ for Nationalites, Xixiangtanglu, Nanning, Guangxi, 530006, China) |
| Abstract: |
| We obtain an algorithm for signature class transportation problems, and turn out that the algorithm is a polynomial-time algorithm.Time complexity for the algorithm is O(mn2+m2n). |
| Key words: transportation problem signature polynomial-time algorithm |
