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

      Local search in routing problems with time windows

      Annals of Operations Research
      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.

          Related collections

          Most cited references4

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

          Computer Solutions of the Traveling Salesman Problem

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

            State-space relaxation procedures for the computation of bounds to routing problems

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

              Some Examples of Difficult Traveling Salesman Problems

                Bookmark

                Author and article information

                Journal
                Annals of Operations Research
                Ann Oper Res
                Springer Nature
                0254-5330
                1572-9338
                December 1985
                December 1985
                : 4
                : 1
                : 285-305
                Article
                10.1007/BF02022044
                ab7ba60b-321a-4653-aeba-26462da5f42d
                © 1985
                History

                Comments

                Comment on this article