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

      A polyhedral branch-and-cut approach to global optimization

      ,
      Mathematical Programming
      Springer Nature

      Read this article at

      ScienceOpenPublisher
          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 references10

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

          Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

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

            An outer-approximation algorithm for a class of mixed-integer nonlinear programs

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

              Global optimization of mixed-integer nonlinear programs: A theoretical and computational study

                Bookmark

                Author and article information

                Journal
                Mathematical Programming
                Math. Program.
                Springer Nature
                0025-5610
                1436-4646
                June 2005
                May 2005
                : 103
                : 2
                : 225-249
                Article
                10.1007/s10107-005-0581-8
                701afc57-9b9c-401a-98e1-619a8d7c9f59
                © 2005
                History

                Comments

                Comment on this article