| Display title | Knapsack problem/Bounded/Mathprog |
| Default sort key | Knapsack problem/Bounded/Mathprog |
| Page length (in bytes) | 2,521 |
| Namespace ID | 0 |
| Page ID | 8339 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 2 |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 0 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Nigel Galloway (talk | contribs) |
| Date of page creation | 12:21, 9 January 2012 |
| Latest editor | rosettacode>Ledrug |
| Date of latest edit | 21:22, 11 January 2012 |
| Total number of edits | 4 |
| 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. | Problem: knapsack Rows: 2 Columns: 22 (22 integer, 11 binary) Non-zeros: 44 Status: INTEGER OPTIMAL Objective: knap_value = 1010 (MAXimum)... |
