Upload
achchuthan-yogarajah
View
1.080
Download
5
Tags:
Embed Size (px)
DESCRIPTION
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the count of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most useful items. http://java90.blogspot.com/2012/02/knapsack-problem-in-java.html
Citation preview
Knapsack ProblemY Achchuthan
University of Jaffna
Knapsack Problem
●
● …●
●
○
○
Knapsack Problem Variants
❖➢
❖➢➢ …
Greedy Knapsack - Fractional
❖❖
❖❖
Greedy Knapsack Algorithm
←←
←←
←←
←
Example - Greedy Knapsack
➔◆◆◆
➔➔
◆◆◆ ⅔
Analysis
ThankYou http://java90.blogspot.com/2012/02/knapsack-problem-in-java.html