搜索资源列表
01背包问题
- 采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~-used Branch and Bound France 0 / 1 knapsack problem! I practice on the machine operations, acceptance by the teachers, qualified! In view of the attachment on the machine for students to the
fjdjf
- 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪.-branch line with the law to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem loading. Optimal handling operations Q premises
01package
- 背包问题优先队列分枝限界算法 所谓的背包问题，可以描述如下：一个小偷打劫一个保险箱，发现柜子里有N类不同大小与价值的物品，但小偷只有一个容积为M的背包来装东西，背包问题就是要找出一个小偷选择所偷物品的组合，以使偷走的物品总价值最大。这个问题的求解有很多种方法，本程序使用分枝限界法求解。-knapsack problem Branch and Bound priority queue algorithm called knapsack problem can be described as f
fenzhidingjie beibao
- 分支定界的0/1背包问题-branch delimitation of the 0 / 1 knapsack problem
dynamic knapsack
- 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparab
01beibao.rar
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！,01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
knapsack
- 0—1背包问题的五种解法 1贪心法 2动态规划 3回溯 4分支限界 5遗传算法-0-1 knapsack problem greedy algorithm five Solution 1 2 3 back in 4 dynamic programming genetic algorithm branch and bound 5
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
sd
- 大家看看 0-1背包的分支界限程序-We look at the 0-1 Knapsack procedures branch boundaries
55
- 背包问题分枝界限算法的源代码 其中包括背包容量、下限、剩余容量、当前价值之和 等-Branch-and-bound algorithm for knapsack problem of the source code including backpack capacity, the lower limit, the remaining capacity, the current value and so on
knapsackproblems
- 本程序用MFC实现了背包问题中贪婪法，动态规划法，蛮力法，分支界限法的可视化-This procedure using MFC in a knapsack problem greedy method, dynamic programming method, brute force method, branch visualization limits of the law
maxProfitBBKnapsack
- 用vc++6编写的程序，采用最大收益分枝定界法，解决背包问题。-Vc++6 prepared with the procedure for the maximum benefit from branch and bound method to solve knapsack problem.
backpackbranchandbound
- 这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm
01-knapsack-problem--
- 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program
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
KnapSack
- 蛮力、动态规划、回溯、分支限界四种算法求解0/1背包问题-Four algorithms（brute force, dynamic programming, backtracking, branch and bound ） to solve 0/1 knapsack problem
0-1-knapsack-problem-solution
- 这是一个关于0-1背包问题算法的编程实现，包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm
knapsack
- A branch and bound algorithm for the 0-1 knapsack problem.
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
branch01
- Knapsack branch-and-bound (deep-first)