Jump to content

Unbounded knapsack problem

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Dantheox (talk | contribs) at 09:05, 10 December 2005 (Main article mentions unbounded case). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)