39
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      The traveling-salesman problem and minimum spanning trees: Part II

      ,
      Mathematical Programming
      Springer Nature

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Most cited references10

          • Record: found
          • Abstract: not found
          • Article: not found

          Computer Solutions of the Traveling Salesman Problem

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              A Method for Solving Traveling-Salesman Problems

              G. Croes (1958)
                Bookmark

                Author and article information

                Journal
                Mathematical Programming
                Mathematical Programming
                Springer Nature
                0025-5610
                1436-4646
                December 1971
                December 1971
                : 1
                : 1
                : 6-25
                Article
                10.1007/BF01584070
                ce92afce-db97-47d2-8223-26d80c0dd8dd
                © 1971
                History

                Comments

                Comment on this article