搜索资源列表
Codes(multiple-Bin-Packing)
- 利用C语言，解决多为背包问题的禁忌搜索算法！世界名家所写！-Tabu search code for multimentional bin packing problem
ts-solve-0-1-knapsack-a-info
- 用禁忌搜索解决0-1背包问题，及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data
0-1beibaowenti
- 应用禁忌搜索算法解决0-1背包问题，可以快速得到最优结果，用matlab实现-Application of tabu search algorithm to solve 0-1 knapsack problem, you can quickly get the best results, using matlab realize
禁忌搜索算法
- 禁忌搜索解决背包问题，matlab环境实现c流程(Tabu search solves knapsack problem, and C flow is realized in Matlab environment.)
应用禁忌搜索算法解决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.)