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

      A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

      Operations Research
      Institute for Operations Research and the Management Sciences (INFORMS)

      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 references21

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

          Integer Programming Formulation of Traveling Salesman Problems

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

            A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem

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

              Local search in routing problems with time windows

                Bookmark

                Author and article information

                Journal
                Operations Research
                Operations Research
                Institute for Operations Research and the Management Sciences (INFORMS)
                0030-364X
                1526-5463
                June 2006
                June 2006
                : 54
                : 3
                : 573-586
                Article
                10.1287/opre.1060.0283
                be2bbc18-0147-4b8b-825f-b37c3199ef34
                © 2006
                History

                Comments

                Comment on this article