搜索资源列表
0-1-Knapsack-problem
- 本次实验选择0-1背包问题作为题目，通过使用动态规划、回溯法和分支定界法等算法来求解该问题，从而进一步的了解各种算法的原理、思路及其本质，深化对算法的了解，锻炼自己对各种算法的分析和使用，熟悉软件底层算法和界面编程。-The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and branch and bound method algorit
bag-matlab
- 背包问题动态规划matlab实现.txt 背包问题动态规划matlab实现.txt -Knapsack problem dynamic programming matlab realize. Txt knapsack problem dynamic programming matlab realize. Txt knapsack problem dynamic programming matlab realize. Txt
psoPsa
- 粒子群算法混合模拟退火算法计算背包问题的算例-PSO hybrid simulated annealing algorithm knapsack problem examples
beibaowenti
- 辅助新手理解一位数组的背包问题 没有别的了 价值真的不大 -good is good oh ok how are you fine think and you
acm-beibao
- acm动态规划背包问题详解一共有九讲，非常非常的实用-acm dynamic programming knapsack problem Elaborates a total of nine speakers, very very practical
01bag
- 用动态规划算法所编写是01背包问题的实现，能在ACM平台上通过-Prepared by using dynamic programming algorithm implementation is 01 knapsack problem, in ACM Platforms
ACM
- acm超级经典的算法。内容包括河内塔 费式数列 巴斯卡三角形 三色棋 老鼠走迷官（一） 老鼠走迷官（二） 骑士走棋盘 八个皇后 八枚银币 生命游戏 字串核对 双色、三色河内塔 背包问题（Knapsack Problem） 数、运算 蒙地卡罗法求 PI 等等。-acm super classic algorithms. Including Hanoi Tower Fei-style Liebasika tri
recursive
- 背包问题是NP完全问题，本程序通过递归法实现了一种优化的背包。-Recursive method to solve the knapsack problem
dynamic
- 背包问题是NP完全问题，本程序通过动态规划法优化实现了一种背包问题。-Knapsack problem is NP-complete problems, this program through dynamic programming optimization implements a knapsack problem.
fzxj
- 分支限界法是一种优化方法，背包问题是NP完全问题，本程序通过分支限界实现了一种优化的背包。-Branch and bound method is an optimization method, knapsack problem is NP-complete problems, this program through the branch and bound to achieve an optimized backpack.
hs
- 背包问题是NP完全问题，本程序通过回溯法实现了一种优化的背包。-Knapsack problem is NP-complete problems, this program through backtracking realize an optimized backpack.
tanxin
- 背包问题是一种NP完全问题，使用贪心法优化解决背包问题。-Knapsack problem is an NP-complete problem, use the greedy algorithm optimization to solve knapsack problem.
0-1
- 用动态规划思路去解答经典的0-1背包问题，已成功通过调试-Using dynamic programming ideas to answer the classic 0-1 knapsack problem, has successfully passed the debugging
0-1Jump
- 用动态规划去解答0-1背包问题，此方法是在经典背包问题上进行的跳跃点优化而解答出来的，已成功通过编译调试-Using dynamic programming to answer 0-1 knapsack problem, this method is carried out on the classic knapsack problem jumps out optimization solutions, has successfully passed the compiler debugging
Poweallocation2013paper
- 考虑了基站通过多个中继与多个用户的问题，基于背包问题提出了最优功率分配。-the optimal power allocation is presented based on knapsack problem for a system with a base station communication with multiple users assisted by multiple relay.
beibao
- 这是背包问题的程序，用matlab实现，背包问题是NP完全问题-This is the knapsack problem program, using matlab , knapsack problem is a a NP-complete problem
yibanbeibao
- 用JAVA实现一般背包问题（附院码）比较实用-Knapsack problem
bag
- 这是求背包问题的一个程序，主要用了递归穷举的思想，希望可以帮到大家-This is a program seeking knapsack problem, the main idea of using a recursive exhaustive, I hope you can help
Deformation-knapsack-problem
- 背包问题的变形，可以更好的理解，01背包，完全背包，多重背包问题等问题-Deformation knapsack problem can be better understood, 01 backpacks, completely backpack, multiple knapsack problem and other issues
leastpackage
- 实现了最小背包问题的解决，利用优先级队列来解决-Achieve a minimum knapsack problem, the use of priority queues to resolve