aa

说明：  在过去的几年中, 背包问题吸引了众多理论研究人员和应用工作者的注意力, 因而得到了广泛而深入的研究。理论方面, 研究兴趣主要来自于该问题简单的结构, 而这种特点既可以深入探索许多组合特性, 又可以通过解决一系列背包子问题来最终求解更为复杂的优化问题。实践方面, 这些问题可以表述许多工业场合的应用, 最典型的应用包括货 物装载、存储分配和资本预算等等。在寻找背包问题可行解的过程中, 出现了众多的算法, 本文是利用MATLAB 程序求背包问题可行解的一种算法。(In the past few years, knapsack problem has attracted many researchers and application of theoretical attention of workers, which has been extensive and in-depth study. Theory, research interest mainly from the simple structure of the problem, and this characteristic combination of both in-depth exploration of many features, but also can solve a series of knapsack sub-problems to solve more complex final optimization problem. Practice, these problems can be expressed in many industrial applications where the most typical applications include cargo loading, storage, distribution and capital budgets, and so on. Knapsack problem in finding feasible solutions in the process, there have been many algorithms, this is the knapsack problem using MATLAB program seeking a feasible solution algorithm.)