| Display title | Knapsack problem |
| Default sort key | Knapsack problem |
| Page length (in bytes) | 338 |
| Namespace ID | 0 |
| Page ID | 3790 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Number of subpages of this page | 14 (3 redirects; 11 non-redirects) |
| Page views in the past month | 0 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | rosettacode>Pelci |
| Date of page creation | 13:19, 14 February 2010 |
| Latest editor | rosettacode>Markhobley |
| Date of latest edit | 22:23, 10 February 2013 |
| Total number of edits | 7 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In a knapsack problem, the goal is to maximize some value subject to a set of constraints. Though the continuous case is very simple, the discrete cases are NP-complete... |
