| 单向Hamilton最优通路的求解新方法及其算法设计 |
| |
| 引用本文： | 张银明. 单向Hamilton最优通路的求解新方法及其算法设计[J]. 华侨大学学报(自然科学版), 2003, 24(3): 314-320 |
| |
| 作者姓名： | 张银明 |
| |
| 作者单位： | 华侨大学信息科学与工程学院,福建,泉州,362011 |
| |
| 摘 要： | Hamilton(哈密尔顿 )问题包括最小 Hamilton圈 ,以及单向 Hamilton最优通路两个基本问题 ,后者属于排序问题 .同 H-圈问题一样 ,目前尚无一种有效求解方法 .使用元素判别值分配法求解单向 H-通路问题 ,仅一次调配便可获得最优的单向 H-通路 ,无须调整 .它具有显著的特点 .文中介绍单向 H-通路求解的表上作业法及计算机程序的算法设计 .
|
| 关 键 词： | 排序问题 Hamilton圈 单向Hamilton通路 元素判别值分配法 算法设计 |
| 文章编号： | 1000-5013(2003)03-0314-07 |
| 修稿时间： | 2002-12-09 |
A New Method for Solving One-Way Hamilton Best Path and Its Algorithm Design |
| |
| Zhang Yinming. A New Method for Solving One-Way Hamilton Best Path and Its Algorithm Design[J]. Journal of Huaqiao University(Natural Science), 2003, 24(3): 314-320 |
| |
| Authors: | Zhang Yinming |
| |
| Abstract: | Hamilton problem comprises minimum Hamilton cycle and one way Hamilton best path as two basic parts. Both await effective method for solving. By using allocation of element discriminating value, one-way Hamilton best path can be solved. The best one-way Hamilton path as a problem of sorting can be obtaincd only by once allocation. This is an outstanding solution which needs not any adjustment. The author presents here its working system on list and its algorithm design of conputer program. |
| |
| Keywords: | problem of sorting Hamilton circle one-way Hamilton path allocation of element discriminating value algorithm design |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
