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

      New trends in exact algorithms for the 0–1 knapsack problem

      , ,
      European Journal of Operational Research
      Elsevier BV

      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 references13

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

          Discrete-Variable Extremum Problems

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

            Computing Partitions with Applications to the Knapsack Problem

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

              An Algorithm for Large Zero-One Knapsack Problems

                Bookmark

                Author and article information

                Journal
                European Journal of Operational Research
                European Journal of Operational Research
                Elsevier BV
                03772217
                June 2000
                June 2000
                : 123
                : 2
                : 325-332
                Article
                10.1016/S0377-2217(99)00260-X
                1a802b2b-7d72-49cc-9175-16fb494a7c27
                © 2000

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article