| Display title | Knapsack problem/Continuous |
| Default sort key | Knapsack problem/Continuous |
| Page length (in bytes) | 134,517 |
| Page ID | 3859 |
| 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 | 2 (0 redirects; 2 non-redirects) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | rosettacode>Pelci |
| Date of page creation | 23:28, 24 February 2010 |
| Latest editor | Avk (talk | contribs) |
| Date of latest edit | 11:31, 23 October 2022 |
| Total number of edits | 199 |
| Total number of distinct authors | 84 |
| Recent number of edits (within past 180 days) | 4 |
| Recent number of distinct authors | 2 |
| Transcluded template (1) | Template used on this page:
|
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | A thief burgles a butcher's shop, where he can select from some items. The thief knows the weights and prices of each items. Because he has a knapsack with 15... |
