单向Hamilton最优通路的求解新方法及其算法设计  

A New Method for Solving One-Way Hamilton Best Path and Its Algorithm Design

作　　者：张银明[1] 

机构地区：[1]华侨大学信息科学与工程学院,福建泉州362011

出　　处：《华侨大学学报（自然科学版）》2003年第3期314-320,共7页Journal of Huaqiao University(Natural Science)

摘　　要：Hamilton(哈密尔顿 )问题包括最小 Hamilton圈 ,以及单向 Hamilton最优通路两个基本问题 ,后者属于排序问题 .同 H-圈问题一样 ,目前尚无一种有效求解方法 .使用元素判别值分配法求解单向 H-通路问题 ,仅一次调配便可获得最优的单向 H-通路 ,无须调整 .它具有显著的特点 .文中介绍单向 H-通路求解的表上作业法及计算机程序的算法设计 .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.

关 键 词：排序 单向Hamilton最优通路 求解方法 算法设计 元素判别值分配法 Hamilton问题 最小Hamilton圈 

分 类 号：O223[理学—运筹学与控制论]