Jump to content

0/1 knapsack problem

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Ellmist (talk | contribs) at 07:57, 26 July 2002 (new). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The knapsack problem restricted so that the number of each item is zero or one.

More information included in the knapsack problem.

This article (or an earlier version of it) contains material from FOLDOC, used with permission. Update as needed.

Retrieved from "https://en.wikipedia.org/w/index.php?title=0/1_knapsack_problem&oldid=216754"