Finding the most efficient paths between two vertices in a knapsack-item weighted graph
Nadav Voloch · International Journal of Advanced Computer Research · 2016
The research is within the scope of theoretical algorithms.In this branch, there are two well-known problems that are:A. The knapsack problem dating back far as more than a century ago, in which, for a set of items, we have to determine how many items of every type 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 as reviewed in [1].A knapsack item is described as follows: An item, that represent an object of some sort (usually, merchandise). The item has at least two attributes (could be more) of weight (w i ) and value (v i ). The item's attributes are comparable to other items' attributes.