节点文献
关于汉密尔顿最短路径的算法
Arithmetic About the Shortest Route of Hamilton Loop
【摘要】 提出了一个对业已存在的赋权汉密尔顿回路进行优化的算法。该算法以经典算法的解为起点,寻找其局部极值点,极大改进了经典启发式算法的性能。该算法属半多项式算法。图8表1参2
【Abstract】 Discusses an arithmetic about how to find out a Hamilton loop,which possesses the minimum total weight.From the result of any classical arithmetic,the arithmetic can get its partial optimization,so it improves the ability of all classical arithmetic about Hamilton loop,And its workload can be expressed as polynomial.
【关键词】 汉密尔顿回路;
古典算法;
优化;
多项式;
【Key words】 Hamilton loop; Classical arithmetic; Optimization; Polynomial;
【Key words】 Hamilton loop; Classical arithmetic; Optimization; Polynomial;
- 【文献出处】 东方电气评论 ,Dongfang Electric Review , 编辑部邮箱 ,2004年01期
- 【分类号】O224
- 【被引频次】11
- 【下载频次】634