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 number 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 valuable items.
The problem often arises in resource allocation where there are financial constraints and is studied in fields such as combinatorics, computer science, complexity theory, cryptography and applied mathematics.
The knapsack problem has been studied for more than a century, with early works dating as far back as 1897.
It is not known how the name "knapsack problem" originated, though the problem was referred to as such in the early works of mathematician Tobias Dantzig (1884-1956), suggesting that the name could have existed in folklore before a mathematical problem had been fully defined.
This program can resolved the problem in 2 way :
- Either by using a "Branch And Bound" algorithm.
- Either by using a Greedy algorithm. This program is still being manufactured, version 2 players drag & drop is in progress.
Thus an improvement of the visual.