搜索资源列表
bag1
- 用动态规划法解决0/1背包问题，上传的是源码，经调试可以运行-use dymnamic Programming answer the knapsack problem
SpecialPacket
- 特殊的0-1背包问题求解，使用贪心法求解，有多个贪心策略。-0-1 Knapsack Problem particular, the use of greedy method, a number of greedy strategy.
0_1Knasack
- 比较了求解0-1背包问题常用的几种算法，并用回溯法和分支限界法进行了Java编程实现，给出了文档及源码。-0-1 knapsack problem compared several commonly used algorithms, and use backtracking and branch and bound method of the Java programming, given the documentation and source code.
treasure
- 寻宝问题 动态规划算法 原理同0/1背包问题-Treasure Hunt with the principles of dynamic programming algorithm problems 0/1 knapsack problem
MNTH
- 在管理科学、计算机科学、分子物理学、生物学、超大规模集成电路设计、代码设计、图像处理和电子工程等领域中，存在着大量的组合优化问题。例如，货郎担问题、最大截问题、0—1背包问题、图着色问题、设备布局问题以及布线问题等，这些问题至今仍未找到多项式时间算法。-In management science, computer science, molecular physics, biology, VLSI design, code design, image processing and electro
knapbranch
- 0-1背包问题的分支定界算法实现。包含优先队列的实现细节。-0-1 knapsack problem branch and bound algorithm. Priority queue that contains the implementation details.
knapdynamicprogram
- 0-1背包问题的动态规划算法实现。包含1维及2维0-1背包问题。-0-1 knapsack problem dynamic programming algorithm. Contains 1-D and 2-dimensional 0-1 knapsack problem.
01
- 动态规划算法之0-1背包问题算法的实现。-Dynamic programming algorithm of 0-1 knapsack problem algorithm.
Knapsack
- 0/1背包问题，java差分进化算法实验-0/1 knapsack problem, java experimental differential evolution algorithm
0-1-back-pag-problem
- 背包问题 主要是应用了回溯的算法实现的 还用到了栈的思想-Knapsack problem is the application of backtracking algorithm are also thought to use a stack
dd
- 分支限界法。这是一个“0 - 1 背包问题的分枝－限界算法”。文件压缩没有密码。-Branch and bound
Genetic_Algorithm_0_1knapProblem
- 0-1背包问题是个NP难问题，本程序基于遗传算法，求解0——1背包问题。-Solve 0_1 knap problem with genetic algorithm
invst2
- 用matlab实现投资问题（类似于0-1背包问题，但更复杂）的动态规划-Problem with matlab realized investment (like the 0-1 knapsack problem, but more complex) dynamic programming
01bag
- 实现经典0-1背包问题，采用动态规划、分枝限界、回溯法、贪心算法等四个算法分别实现0-1背包问题，并有一个四合一的算法统一用四种方法实现。并对其时间复杂度进行了分析。-To achieve the classic 0-1 knapsack problem, dynamic programming, branch and bound, backtracking, greedy algorithm to achieve the four algorithms are 0-1 knapsack pro
bag
- 介绍了0-1背包问题的求解，并用贪心算法解决了背包问题-Introduced to solve 0-1 knapsack problem and solved with the greedy algorithm knapsack problem
TestKnapsack
- 0-1背包问题java算法及实现，使用java图形界面-0-1 knapsack problem java algorithm and implementation, the use of java GUI
ANT-TX
- 用蚁群算法和贪心算法解决0/1背包问题。可用于不同算法的比较。-Solving 0/1 Knapsack Problem by ant colony algorithm and greed method.Can be used to compare two algorithms.
beibao
- 用动态规划的方法解0/1背包问题。用VC6编译运行正确。供参考-Using dynamic programming for solving 0/1 knapsack problem. Compile and run correctly with VC6. Reference
knapsack(five)
- 实现0-1背包问题的优先队列分支限界算法 FIFO 分支限界算法 递归法 回溯法 动态规划算法-0-1 knapsack problem to achieve the priority queue FIFO branch and bound algorithms branch and bound backtracking algorithm recursion dynamic programming algorithm
01bag
- 0-1背包问题，采用了动态规划的算法，输入物品的重量和价值，以及背包的容量，计算出最优解-0-1 knapsack problem, using a dynamic programming algorithm ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ~~~~~