搜索资源列表
BBExample
- 本文件主要是关于分支定界算法的MATLAB程序，采用分支定界法来求取线性规划与非线性规划等问题的全局最优解。-This document is a MATLAB program on the branch and bound algorithm using the branch and bound method to strike a global optimal solution of linear programming and nonlinear programming problems.
code_branch_s3vm
- 基于半监督支持向量机算法，能得到全局最优解，很好用。-Run test_two_moons.m to see the solution of the branch-and-bound algorithm on the two moons toy problem
MIP
- 运用分枝定界法求解混合整数规划程序 各输入参数的含义： min f*x A*x<=b Aeq*x=beq iter_num_max:迭代次数的上限 lb:各变量的下限 ub:各变量的上限 x0:初值 ID:0、1变量，ID(k)=1,表示第k个变量为整数变量，ID(k)=0，表示第k个变量为非整数变量 ftemp_up:初始上界,无法找到初始上界，默认为无穷大 IP：初始可行解，无法找到初始可行解，默认为空 各输出参
fenzhidingjie
- 本程序用C语言编写实现，程序源代码文件为“分支定界实现源程序.c” ，在windows XP下用VC++6.0上编译运行通过，生成可执行文件“分支定界实现程序.exe” 。运行程序时，请将题目中所给的文件“m1.txt” 和“m2.txt”与可执行文件“分支定界实现程序.exe”放在同一个文件夹下，然后双击打开“分支定界实现程序.exe”即可运行程序。-The program using the C language implementation, program source code fil
shortestPath
- 用Java语言实现的用分支限界法解决单源最短路径问题的算法-An implementation of single source shortest path problem with Java language based on branch and bound method
yundongyuan
- 这是在大二学习算法分析时写的关于分支界限法，运动员最佳配对问题。-This is a write the sophomore learning algorithm analysis on the branch and bound method, the best athletes pairing problems.
BranchBound
- un code source pour branch and bound
0_1beibao
- 0_1背包问题的分支定界法算法 希望帮到大家-0_1 branch and bound method for the knapsack problem algorithm
BAB
- 使用分支定界法进行特征选择，是基于单调准则函数进行优化搜索的一种方法。-Feature selection using the branch and bound method, a method based on a monotonic criterion function to optimize the search.
lvxingfenzhishangxian
- 计算机算法分析实习源码，旅行售货员问题，分枝限界法，通过调试-Computer algorithm analysis internship source, the traveling salesman problem, branch and bound, and through the debugger
MaxClique
- 分支界限法解决最大团问题，编译通过，代码正确-Branch and bound method to solve the maximum clique problem, compiled through the correct code
minPath
- 这是一道算法作业题目，解决一个分支定界问题，求最短路径问题-This is an algorithm assignment questions to resolve a branch and bound for the shortest path problem
zhengshuguihua
- 整数规划：用割平面法求解整数规划 用分支定界法求解整数规划 用枚举法（包括穷举法和隐枚举法）求解0－1规划 -Integer programming: cutting plane method for solving integer programming with branch and bound method for solving integer programming Solving 0-1 planning enumeration method (exhaustive me
0-1
- 我自己用C写的一个用分支界限法实现0-1背包问题，比较简便实用，而且易懂，比回溯法有明显的优势-I have written in C, a branch and bound method 0-1 knapsack problem is relatively simple and practical, and easy to understand, there are obvious advantages than backtracking
solution-of-knapsack-problem
- 回溯法、分支限界法的原理，并能够按其原理编程实现解决0-1背包问题，以加深对回溯法、分支限界法的理解。 -Backtracking, branch and bound method principle, and can according to the principle of programming to realize solving knapsack problem, in order to deepen our understanding of the backtracking, bra
0-1packets
- 一个算法的实现：使用分支界限法求解0-1背包问题-The realization of an algorithm: 0-1 knapsack problem using the branch and bound method
fenzhidingjie
- 分支定界法，解决整数规划问题，很好的优化算法，可以学习-Branch and bound method to solve the problem of integer programming, a good optimization algorithm can learn
fenzhixianjie
- 分支限界法实现0-1背包问题源代码测试通过-Source code testing by branch and bound 0-1 knapsack problem
ZeroOnePack
- 分支界限法求解0-1背包问题。有N件物品和一个容量为V的背包，第i件物品的费用是c[i]，价值是w[i]，求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。-Branch and bound method for solving 0-1 knapsack problem. N items and a capacity V of the backpack, the cost of items i C [i], the value of W [i], the sum of
BOND_BRANCH_SS
- 利用分支定界法处理单源最短路径，很好的设定了上界下界。效率很高。-solve the problem “Shorttest Path Singal source” by using branch and bound