高级检索

    刘剑平. TSP邻近算法在Euclid平面上的性能比分析[J]. 华东理工大学学报（自然科学版）, 2004, (3): 336-338.
    引用本文: 刘剑平. TSP邻近算法在Euclid平面上的性能比分析[J]. 华东理工大学学报（自然科学版）, 2004, (3): 336-338.
    shu
    LIU Jian-ping. Performance Ratio Analysis of the Nearest Neighbor Algorithm of TSP in Euclidean Plane[J]. Journal of East China University of Science and Technology, 2004, (3): 336-338.
    Citation: LIU Jian-ping. Performance Ratio Analysis of the Nearest Neighbor Algorithm of TSP in Euclidean Plane[J]. Journal of East China University of Science and Technology, 2004, (3): 336-338.
    shu

    TSP邻近算法在Euclid平面上的性能比分析

    Performance Ratio Analysis of the Nearest Neighbor Algorithm of TSP in Euclidean Plane

      摘要
    • 摘要: 旅行推销员问题(TSP)邻近算法的性能比已经被证明有一个关于点数的对数函数上界，本文就该方法在欧几里得平面上给出了性能比的一个对数下界。

       

      Abstract: The performance ratio of the nearest neighbor algorithm of traveling salesman problem has been shown to have an upper bound above by a logarithmic function of the number of nodes. In this paper, we provide a logarithmic lower bound on the worst case in Euclidean plane.

       

      • HTML全文
      • 参考文献(0)
      • 相关文章
      • 施引文献
    • 资源附件(0)

    /

    返回文章
    返回