皇后问题研究及算法比较分析 田金梁.doc

《算法分析与设计》课程大作业 题 目　 0-1背包问题研究及算法分析 院 别 计算机与信息工程学院 专 业　 计算机与科学技术 年 级　 2013级 学 号　 1308114091 姓 名　 田金梁 指导教师　 王鲜芳 成 绩 6/28/2016 0-1背包问题研究及算法分析 摘要 背包问题是一个在运筹学领域里常见的典型NP-C难题对该问题的求解方法的研究无论是在理论上,还是在实践中都具有重要意义。回溯法有针对性地设计适合求解背包问题的算法Research and algorithm analysis of 0-1 knapsack problem Abstract Knapsack problem is a in operations research in the field of typical NP-C problem, is the design and analysis of algorithms in the classic problem, solving method of the problem both in theory and in practice has important significance. The solution of the problem has developed the many classic methods, the exploration and application research has been in. Under the guidance of advanced theory, solving 0-1 knapsack problem has significant characteristics of scientific and efficient, economic, flexible, convenient and so on. So to solve the knapsack problem, the first premise is to design a good algorithm, to obtain the solution of the knapsack problem, we must first design algorithm, based on Backtracking knapsack problem, complexity analysis of the algorithm design and 0-1 knapsack problem and the simple 0-1 knapsack problem, the specific design and implementation process and algorithm is given. With concrete examples with different methods are described to solve the algorithm the basic idea, and then solve the 0-1 knapsack problem for a detailed comparison of the four algorithms, to achieve the advantages and disadvantages of this method and summarizes the conclusion. How will the knapsack problem is applied to practical problems, to design suitable for solving 0-1 knapsack problem the algorithm, and it is quite good to solve practi