搜索资源列表
用分枝定界法求解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-and-bound algorithm descr iption, in text form!
Algorithm_Design
- 算法设计与分析，其中包括贪婪算法、分而治之算法、动态规划、回溯、分枝定界
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 递归函数 5 1.3 动态存储分配
intprog
- 分枝定界法程序，解混合整数线性规划《详解MATLAB在最优化计算中的应用》中的分枝定界法程序，稍作了修改-Branch and bound method procedures, the solution mixed integer linear programming, " Detailed MATLAB optimization calculation in the application" in the branch and bound procedure, slightl
fenzhidingjieMATLAB
- 分枝定界法求解整数规划的MATLAB实现-Branch and Bound Method for Solving Integer Programming MATLAB to achieve
bnb20
- 非线性整数规划算法，求解非线性整数规划活混合规划问题，常用的算法是分枝定界算法。基于该算法编成的现成函数bnb20()-Nonlinear integer programming algorithm for solving nonlinear mixed integer programming live planning problem, commonly used algorithms are branch-and-bound algorithm. Based on the algorithm
multiuserdetector
- 在码分多址系统中,求解多用户检测问题是重要环节,介绍了多用户检测问题的应用背景和发展 现状,重点综述基于半定规划模型寻求多用户检测问题次优解的几种重要方法,包括随机扰动法、 坐标下降法、半定规划的割平面法和二次规划的分枝定界法等。结合数值实验,评析比较了这些 方法的优缺点-Quasi-Maximum-Likelihood Multiuser Detection Using Semi-Definite Relaxation With Application to Synchro
Branch-and-Price
- Branch—and—Price，一种广义分枝定界或分枝定界的扩展算法，它允许列生成过程应用于整个分枝定界树-The philosophy of branch-and-price is similar to that of branch-and-cut except that the procedure focuses on col- umn generation rather than row generation.
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.
shuxuesuanfa
- 包括分枝定界算法，线性规划单纯形算法，马尔可夫链算法，贝叶斯决策方法，生产计划算法，动态规划的投资问题的C语言解决-Including the branch-and-bound algorithm, linear programming simplex algorithm, Markov chain algorithms, Bayesian decision-making methods, production planning algorithms, dynamic programming i
DataStructuresandAlgorithmAnalysis
- 全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法。-A comprehensive and systematic introduction to the queue, stack, tree, map and other basic data structures, as well as greedy algorithms, divide and conquer algorithms, branch and bound algorith
Computeralgorithmsr
- 计算机算法_贪婪算法 计算机算法（贪心算法，遍历搜索，递归，回溯法，分治法，分枝定界) 关于这方面的介绍-计算机算法_贪婪算
BranchBound
- 最优化问题中分枝定界法求解整数线性规划问题-Optimization of branch and bound method for solving integer linear programming problem
用分枝定界法求解整数线性规划问题
- matlab代码，用分枝定界法求解整数线性规划问题。(Matlab code, use the branch and bound method for solving integer linear programming problem.)
分枝限界算法
- 分支定界算法， 分支定界算法 分支定界算法 branch and bound(this is a branch and bound)