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

      A polynomial-time algorithm, based on Newton's method, for linear programming

      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.

          Related collections

          Most cited references4

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

          Polynomial algorithms in linear programming

            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            A new polynomial-time algorithm for linear programming

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

              On the efficiency of algorithms of analysis

                Bookmark

                Author and article information

                Journal
                Mathematical Programming
                Mathematical Programming
                Springer Nature
                0025-5610
                1436-4646
                January 1988
                January 1988
                : 40-40
                : 1-3
                : 59-93
                Article
                10.1007/BF01580724
                616d5fe9-1492-4eb7-aba0-75a3811eb704
                © 1988
                History

                Comments

                Comment on this article