Research on the Recommendation Algorithm Based on 0-1 Knapsack Problem

Abstract

Knapsack Problem is a NP complete Problem of combinatorial optimization. The problem can be described as: given a set of items, each item has its own weight and value. Within the limited total weight, how can we choose to maximize the total value of the item? Similar problems often occur in the business, combinatorial mathematics, cryptography, and applied mathematics, and other fields, and this problem can be described as a crucial question, namely "under the premise of not more than the total weight W, can achieve total value V?". This article with a algorithm design, example, grouping solving 0-1 knapsack problem algorithm, analysis the advantages and disadvantages of each algorithm, and the solution algorithm based on knapsack problem, to put forward a recommendation algorithm can be applied in song recommended, advertising, news, etc.