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

      A Computational Study of Search Strategies for Mixed Integer Programming

      ,
      INFORMS Journal on Computing
      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.

          Related collections

          Most cited references22

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

          An Automatic Method of Solving Discrete Programming Problems

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

            A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

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

              An Algorithm for the Traveling Salesman Problem

                Bookmark

                Author and article information

                Journal
                INFORMS Journal on Computing
                INFORMS Journal on Computing
                Institute for Operations Research and the Management Sciences (INFORMS)
                1091-9856
                1526-5528
                May 1999
                May 1999
                : 11
                : 2
                : 173-187
                Article
                10.1287/ijoc.11.2.173
                ecda6a36-e89c-4ffe-8a53-386aecd01422
                © 1999
                History

                Comments

                Comment on this article