摘要
0-1背包问题是算法设计分析中的经典问题,本文主要通过对回溯法、动态规划、贪心算法和遗传算法的研究,分析这四种方法在求解0-1背包问题时的优缺点并进行了比较。
Knapsack problem is a typical question in the design and analysis of algorithms, this article primarily introduces back tracking, dynamic programming, greedy method and genetic algorithm, and analyzes the advantages and disadvantages of these four methods for solving 0-1 knapsack problem separately and makes a conclusion.
出处
《计算机与现代化》
2009年第6期24-26,共3页
Computer and Modernization
关键词
背包问题
回溯法
动态规划
贪心算法
遗传算法
knapsack problem
back tracking
dynamic programming
greedy method
genetic algorithm
