应用禁忌搜索算法解决0-1背包问题

  利用禁忌搜索算法求解0-1背包问题。禁忌搜索算法相比其他搜索算法更优，设置藐视规则来避免陷入局部最优解。(Solve 0-1 Knapsack Problem based on Tabu search. The tabu search algorithm is superior to other search algorithms and sets contempt rules to avoid falling into local optimal solutions.)

030120642_陈洪杰_作业2\0-1背包禁忌搜索编程报告.doc, 118272 , 2012-12-14
030120642_陈洪杰_作业2\main.asv, 1426 , 2012-12-14
030120642_陈洪杰_作业2\main.m, 1493 , 2012-12-22
030120642_陈洪杰_作业2\near.asv, 804 , 2012-12-14
030120642_陈洪杰_作业2\near.m, 819 , 2012-12-14
030120642_陈洪杰_作业2\newlist.asv, 204 , 2012-12-14
030120642_陈洪杰_作业2\newlist.m, 204 , 2012-12-14
030120642_陈洪杰_作业2, 0 , 2012-12-14