Description: 算法设计的分支限界法中的单源最短路径问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC++ prepared Platform: |
Size: 3072 |
Author:ddd |
Hits:
Description: 算法设计中的分支限界法中的批处理作业调度问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of batch job scheduling problem is true, VC++ prepared Platform: |
Size: 10240 |
Author:ddd |
Hits:
Description: 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc Platform: |
Size: 163840 |
Author:yy |
Hits:
Description: 最小重量机器设计问题
设某一机器由n个部件组成，每一种部件都可以从m个不同的供应商处购得。设w(i,j)是从供应商j处购得的部件i的重量,C(i,j)是相应的价格。
设计一个优先列式分支限界法，给出总价格不超过c的最小重量机器设计。-minimum weight machines based design of a machine n components, each component can be 000 m from different vendors purchased. Let w (i, j) is from the supplier j purchased components of the weight i, C (i, j) is the corresponding price. Design a priority out-branch and bound method, the total price is less than the minimum weight c machine design. Platform: |
Size: 2048 |
Author:卢起雪 |
Hits:
Description: 对于给顶的仓库局,以及仓库管理员在仓库中的位置和箱子的开始位置和目标位置,设计一个解推箱子问题的分支限界法,计算出仓库管理员将箱子从开始位置推到目标位置所需的最少推动次数.-To the top of the warehouse for the Board, as well as the warehouse manager in the warehouse location and the beginning of the box location and target location, the design of a solution of the problem Sokoban branch and bound method to calculate the storage administrator will be the location of boxes from the beginning to the target location the minimum number required to promote. Platform: |
Size: 2048 |
Author:李靖平 |
Hits:
Description: 用分枝界限法找图的最短路径，并显示结果。-With branch-and-bound method to find the shortest path map, and the result will be displayed. Platform: |
Size: 2048 |
Author:莫海波 |
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: 用分支定界法求解旅行商问题旅行商问题是一个经典NP问题：有n个城市，一个推销员要从其中的某一个城市出发，每个城市只能遍历一次，要求走遍所有的城市，再回到他出发的城市，求所有可能路径中路径最短的一条路径来。-Using branch and bound method for solving traveling salesman problem traveling salesman problem is a classic NP problem: have n cities, a salesman from one of a city of departure, each city can only traverse once traveled all the requirements of the City , and then returned to his starting city, and all the possible path of the shortest path to a path. Platform: |
Size: 4096 |
Author:bianbian |
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: 分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。-Branch and cut is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values. The method is a hybrid of branch and bound and cutting plane methods. Platform: |
Size: 1384448 |
Author:abrahamlau |
Hits:
Description: 介绍分支限界法的思想，解空间树的搜索，算法的时间性能，图问题中的分支限界法，多段图的最短路径问题等-The idea of the introductory branch and bound method, the search of solution space tree, the time performance of the algorithm, graph problems in the branch and bound method, Multistage Graph shortest path problem Platform: |
Size: 86016 |
Author:乔艳梅 |
Hits:
Description: 利用分支限界法找出最大全1子团和最大全-1子团，内附文档说明-Use branch and bound method to find the maximum full sub-group and the largest full 1 sub-group, enclosing documentation Platform: |
Size: 954368 |
Author:李仲 |
Hits:
Search - branch and bound method