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

      A lagrangean relaxation algorithm for the constrained matrix problem

      , ,
      Naval Research Logistics Quarterly
      Wiley

      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 references12

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

          An O(n) algorithm for quadratic knapsack problems

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

            A polynomially bounded algorithm for a singly constrained quadratic program

              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              On the convergence of a block successive over-relaxation method for a class of linear complementarity problems

                Bookmark

                Author and article information

                Journal
                Naval Research Logistics Quarterly
                Naval Research Logistics
                Wiley
                00281441
                19319193
                February 1986
                February 1986
                : 33
                : 1
                : 55-76
                Article
                10.1002/nav.3800330106
                fe77f7b4-36f6-40a6-969d-fce06db7ad91
                © 1986

                http://doi.wiley.com/10.1002/tdm_license_1.1

                History

                Comments

                Comment on this article