搜索资源列表
pakcageProblem
- 01背包问题，完全背包，以及多重背包问题的详解和源程序。-01 knapsack problem, complete backpack, and multiple knapsack problem Xiangjie and procedures.
knap
- THIS PROGRAM SOLVES A 0-1 MULTIPLE KNAPSACK PROBLEM OF N ITEMS AND M KNAPSACKS. -THIS PROGRAM SOLVES A 0-1 MULTIPLE KNAPSACK PROBLEM OF N ITEMS AND M KNAPSACKS.
XHstudent
- 1.对多个链表进行操作 2.回溯法求解0/1背包 3.分枝限界法求解0/1背包 4.回溯法求解n—皇后问题 5.图的操作（邻接表表示）-1. Operate on multiple lists 2. Backtracking method for solving 0/1 knapsack 3. Branch and bound method for solving 0/1 knapsack 4. Backtracking to solve n-queens pr
bag
- 本程序解决背包问题，其中有多个类型的物品，每类物品可以有任意数量。-The procedure to solve knapsack problem, in which there are multiple types of items, each class can have any number of items.
knapsack
- 背包九讲问题，各种高效解法，值得一看，包括01背包，完全背包，多重背包，一起三种背包的混合问题-Backpack nine speak problems, all kinds of efficient solution, is worth a look Including 01 backpack, completely backpack, multiple backpack, together three backpack of the mixed problem
multi-knapsack(queue)
- 多重背包的单调队列解法，经过测试完美运行！-Multiple backpack monotonous queue solution has been tested and works perfect!
40964005
- 多重背包问题求解算例，很实用很酷。不需任何改动-Multiple knapsack problem
hdu2191NBag
- 杭州电子科技大学ACM评价系统219+1题多重背包的解法-Hangzhou University of Electronic Science and Technology Evaluation System 219+1 ACM multiple knapsack problem solution
Deformation-knapsack-problem
- 背包问题的变形，可以更好的理解，01背包，完全背包，多重背包问题等问题-Deformation knapsack problem can be better understood, 01 backpacks, completely backpack, multiple knapsack problem and other issues
GA_Knapsack
- 有关多背包问题的遗传算法，非常不错，对初学者很有帮助-For multiple knapsack problem genetic algorithm, very good, very helpful for beginners
PSO
- 基于粒子群算法的多目标搜索算法，本案例采用多目标粒子群算法求解多目标背包问题。-Multiple target search algorithm based on particle swarm optimization (pso) algorithm, this case USES the multi-objective particle swarm optimization (pso) algorithm to solve multi-objective knapsack problem.