View source for Publication:1253918

From MaRDI portal

You do not have permission to edit this page, for the following reasons:

  • The action you have requested is limited to users in the group: Users.
  • You do not have permission to edit pages in the Publication namespace.

You can view and copy the source of this page.

Return to A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem.