搜索资源列表
用分枝定界法求解TSP
- 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc
MATLAB_FD
- 整数规划的分枝定界法在MATLAB中的实现-integer programming branch of the profession in the realization of MATLAB
search_method
- 搜索算法——包含回溯法、分枝定界和贪心法
BRANCH
- 分枝定界法，运筹学-branch-and-bound method, and operations
数据结构的C++描述
- 目 录 译者序 前言 第一部分 预备知识 第1章 C++程序设计 1 1.1 引言 1 1.2 函数与参数 2 1.2.1 传值参数 2 1.2.2 模板函数 3 1.2.3 引用参数 3 1.2.4 常量引用参数 4 1.2.5 返回值 4 1.2.6
BRANCH
- 分枝定界法，运筹学-branch-and-bound method, and operations
用分枝定界法求解TSP
- 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc
MATLAB_FD
- 整数规划的分枝定界法在MATLAB中的实现-integer programming branch of the profession in the realization of MATLAB
search_method
- 搜索算法——包含回溯法、分枝定界和贪心法-Search algorithm- includes backtracking, branch and bound and the greedy method
fenzhidingjieMATLAB
- 分枝定界法求解整数规划的MATLAB实现-Branch and Bound Method for Solving Integer Programming MATLAB to achieve
multiuserdetector
- 在码分多址系统中,求解多用户检测问题是重要环节,介绍了多用户检测问题的应用背景和发展 现状,重点综述基于半定规划模型寻求多用户检测问题次优解的几种重要方法,包括随机扰动法、 坐标下降法、半定规划的割平面法和二次规划的分枝定界法等。结合数值实验,评析比较了这些 方法的优缺点-Quasi-Maximum-Likelihood Multiuser Detection Using Semi-Definite Relaxation
BNB
- 工具箱 (分枝定界法工具箱) matlab 中使用-Toolbox (Toolbox branch and bound method) matlab use
maxProfitBBKnapsack
- 用vc++6编写的程序，采用最大收益分枝定界法，解决背包问题。-Vc++6 prepared with the procedure for the maximum benefit from branch and bound method to solve knapsack problem.
BranchBound
- 最优化问题中分枝定界法求解整数线性规划问题-Optimization of branch and bound method for solving integer linear programming problem
intprog
- 分枝定界法程序，解混合整数线性规划《详解MATLAB在最优化计算中的应用》中的分枝定界法程序，稍作了修改-Branch and bound method procedures, the solution mixed integer linear programming, " Detailed MATLAB optimization calculation in the application" in the branc
matlab_branchbound
- 分枝定界法的程序，是一种在问题的解空间树上搜索问题的解的方法。-Procedures of the branch and bound method, a solution space tree search solution.
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:初始上界,无法找到初始上界，默认为无穷大 I
lp_solve_5.1_MATLAB_exe
- 运用分枝定界法求解混合整数规划的matlab程序- Use the branch and bound method for solving mixed integer programming procedures -Use the branch and bound method for solving mixed integer programming procedures
integer-linear-programming
- 最优化的里整数规划里0—1规划算法和分枝定界法，matlab编写，代码规范，方便初学者学习！-the program is with the binary integer linear programming and integer linear programming use branch and bound method!
用分枝定界法求解整数线性规划问题
- matlab代码，用分枝定界法求解整数线性规划问题。(Matlab code, use the branch and bound method for solving integer linear programming problem.)