aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

2016 Update

Browse source
This commit is contained in:
Tina Müller 2016-12-05 22:15:40 +01:00
parent 948b86eafa
commit dcf5d15da3
7965 changed files with 139854 additions and 31002 deletions
Download patch file Download diff file Expand all files Collapse all files

25
Task/Knapsack-problem-Bounded/00DESCRIPTION
View file

@ -1,7 +1,13 @@
A tourist wants to make a good trip at the weekend with his friends. They will go to the mountains to see the wonders of nature. So he needs some items during the trip. Food, clothing, etc. He has a good knapsack for carrying the things, but he knows that he can carry only 4 kg weight in his knapsack, because they will make the trip from morning to evening. He creates a list of what he wants to bring for the trip, but the total weight of all items is too much. He adds a value to each item. The value represents how important the thing for the tourist. The list contains which items are the wanted things for the trip, what is the weight and value of an item, and how many units does he have from each items.
A tourist wants to make a good trip at the weekend with his friends.
They will go to the mountains to see the wonders of nature.   So he needs some items during the trip.   Food, clothing, etc.   He has a good knapsack for carrying the things, but he knows that he can carry only 4 kg weight in his knapsack, because they will make the trip from morning to evening.
He creates a list of what he wants to bring for the trip, but the total weight of all items is too much.   He adds a value to each item.   The value represents how important the thing for the tourist.
The list contains which items are the wanted things for the trip, what is the weight and value of an item, and how many units does he have from each items.
This is the list:
{| style="text-align: left; width: 80%;" border="4" cellpadding="2" cellspacing="2"
|+ Table of potential knapsack items
|- style="background-color: rgb(255, 204, 255);"
@ -54,8 +60,17 @@ This is the list:
| knapsack || ≤400 dag || ? || ?
|}
The tourist can choose to take any combination of items from the list, and some number of each item is available (see the column "Piece(s)" of the list!). He may not cut the items, so he can only take whole units of any item.
<br>
The tourist can choose to take any combination of items from the list, and some number of each item is available &nbsp; (see the column &nbsp; '''piece(s)''' &nbsp; in the list above).
'''Which items does the tourist carry in his knapsack so that their total weight does not exceed 4 kg, and their total value is maximised?'''
He may not cut the items, so he can only take whole units of any item.
See also: [[Knapsack problem/Unbounded]], [[Knapsack problem/0-1]]
;Task:
Show which items does the tourist carry in his knapsack so that their total weight does not exceed 4 kg, and their total value is maximized.
;Related tasks:
* &nbsp; [[Knapsack problem/Unbounded]]
* &nbsp; [[Knapsack problem/0-1]]
<br><br>