Advanced Search
    Optimal Parallel Heuristic Algorithm for Travelling Salesman ProblemJ. Journal of Computer Research and Development, 1994, 31(4).
    Citation: Optimal Parallel Heuristic Algorithm for Travelling Salesman ProblemJ. Journal of Computer Research and Development, 1994, 31(4).
    shu

    Optimal Parallel Heuristic Algorithm for Travelling Salesman Problem

      Graphical Abstract
      • Abstract
    • This paper presents a parallel heuristic algorithm for travelling salesman problem satisfying triangle inequality. This algorithm uses O（n2/log2n） processors and O（log2n）time on SIMD CREWPRAM, where n is the number of given cities, so it is optimal.
      • FullText(HTML)
    • loading
      • References (0)
      • Related Articles

    Catalog

      Turn off MathJax
      Article Contents
      Email Alert RSS

      /

      DownLoad:  Full-Size Img  PowerPoint
      Return
      Return