| 利用F1oyed-Hungary法求解中国邮路问题 |
| |
| 引用本文： | 舒兴明. 利用F1oyed-Hungary法求解中国邮路问题[J]. 华南热带农业大学学报, 2003, 9(2): 32-35 |
| |
| 作者姓名： | 舒兴明 |
| |
| 作者单位： | 华南热带农业大学基础学院,海南,儋州,571737 |
| |
| 摘 要： | 对于中国邮路问题，可以用奇偶点作业法，但当顶点较多时，寻找每一个圈并对其进行检验的工作十分复杂。利用求图中各点之间最短路径的方法Floyed法和求解指派问题的方法Hun—gary法可提供一种对任意个顶点的中国邮路问题的解法—Floyed—Hungary法。
|
| 关 键 词： | 中国邮路问题 奇点 Floyed法 Hungary法 |
The Application of Floyed-Hungary Method in Solving Problems Concerning Chinese Postman |
| |
| Shu Xingming. The Application of Floyed-Hungary Method in Solving Problems Concerning Chinese Postman[J]. Journal of South China University of Tropical Agriculture, 2003, 9(2): 32-35 |
| |
| Authors: | Shu Xingming |
| |
| Abstract: | Odd-evenwork methodcan be applied to solving problemsin Chinese postman,but it involves in more and more complicatedwork whenacmesof exer-cises are piled up.To solve this problem,this paper proposes a newly found method,namely,Floryed-Hungarymethod,whichis based on the methodof seeking for the shortest path betweenevery two acmesin graph and the methodof solv-ing the minimalassignment |
| |
| Keywords: | Chinesepostman odd acme floyed method hungary mehtod |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
