Location:
Search - knapsack branch
Search list
Description: 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-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 incomparable.
Platform: |
Size: 3494 |
Author: 唐海浪 |
Hits:
Description: 分支定界的0/1背包问题-branch delimitation of the 0/1 knapsack problem
Platform: |
Size: 1024 |
Author: 姜艳艳 |
Hits:
Description: 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-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 incomparable.
Platform: |
Size: 3072 |
Author: 唐海浪 |
Hits:
Description: 采用分枝限界法解决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 next ~
Platform: |
Size: 1024 |
Author: 张锐 |
Hits:
Description: 用分支界限法解决的几个问题:包括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.
Platform: |
Size: 59392 |
Author: michael |
Hits:
Description: 背包问题优先队列分枝限界算法
所谓的背包问题，可以描述如下：一个小偷打劫一个保险箱，发现柜子里有N类不同大小与价值的物品，但小偷只有一个容积为M的背包来装东西，背包问题就是要找出一个小偷选择所偷物品的组合，以使偷走的物品总价值最大。这个问题的求解有很多种方法，本程序使用分枝限界法求解。-knapsack problem Branch and Bound priority queue algorithm called knapsack problem can be described as follows : a thief robbed a safe, found N closets, a different type size and value of the items, but the thieves only one volume of M backpack to hold things. knapsack problem is to identify a thief stole items chosen by the portfolio, so that stolen goods worth largest. Solving this problem is many ways, the procedures used Branch and Bound method.
Platform: |
Size: 238592 |
Author: 王涛 |
Hits:
Description: 这是矩形分支定界算法，采用matlab语言环境-branch and bound algorithm, using Matlab language environment
Platform: |
Size: 1024 |
Author: zhangmin |
Hits:
Description: 用分支限界法求解背包问题（0/1背包）
1.问题描述：已知有N个物品和一个可以容纳TOT重量的背包，每种物品I的重量为Weight，价值为Value。一个只能全放入或者不放入，求解如何放入物品，可以使背包里的物品的总价值最大。
2.设计思想与分析：对物品的选取与否构成一棵解树，左子树表示装入，右表示不装入，通过检索问题的解树得出最优解，并用结点上界杀死不符合要求的结点。-Using branch and bound method to solve knapsack problem (0/1 knapsack) 1. Problem Description: known to have N of items and a TOT can accommodate the weight of backpacks, the weight of each item I for Weight, the value of Value. Add a can or not Add-wide, to solve how to Add items, the backpack can make the total value of the largest items. 2. The design and analysis: the selection of items or not constitute a solution tree, into the left subtree said, indicated that he did not load right, through the solution search tree reached the optimal solution, and the upper bound of node to kill refuses to comply with the requirements of nodes.
Platform: |
Size: 1024 |
Author: 黄勇 |
Hits:
Description: 0-1背包问题的分支限界算法实现，有详细的函数功能说明
-0-1 knapsack problem branch and bound algorithm, a detailed description of the function function
Platform: |
Size: 2048 |
Author: 古月 |
Hits:
Description: 01背包问题的优先队列式分枝限界算法程序LCKNAP-01 knapsack problem the priority queue algorithm Branch and Bound-style program LCKNAP
Platform: |
Size: 8192 |
Author: lv |
Hits:
Description: 背包问题
采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~
-Knapsack problem using Branch and Bound method to solve 0/1 Knapsack Problem! My internship on the machine operation, through the teacher acceptance, qualified! The machine for some internship students can come to the next ~
Platform: |
Size: 1024 |
Author: ohyoung |
Hits:
Description: 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
Platform: |
Size: 22528 |
Author: lius |
Hits:
Description: 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
Platform: |
Size: 2048 |
Author: shanyan |
Hits:
Description: 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！-01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
Platform: |
Size: 247808 |
Author: chenchen |
Hits:
Description: 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
Platform: |
Size: 2048 |
Author: L |
Hits:
Description: 这是传统智能优化背包问题用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
Platform: |
Size: 179200 |
Author: yangke |
Hits:
Description: 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
Platform: |
Size: 1052672 |
Author: hehuiling |
Hits:
Description: 0-1背包问题是一个经典的算法问题，有多种解法，这里用分支定界法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved with branch and bound method.
Platform: |
Size: 727040 |
Author: 储大为 |
Hits:
Description: 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
Platform: |
Size: 252928 |
Author: tunzhao |
Hits:
Description: 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program
Platform: |
Size: 778240 |
Author: hudongfang |
Hits: