搜索资源列表
LCKNAP
- 背包问题的LC分支-限界算法 计算机算法设计背包问题求解-LC branch knapsack problem- a computer algorithm and bound algorithm for solving knapsack problem
global optimization
- Global optimization is a branch of applied mathematics and numerical analysis that deals with the optimization of a function or a set of functions according to some criteria. Typically, a set of bound and more general constraints is also present, and
Bound-constraint
- 界约束优化问题是最优化的主要类型，是最优化方向的主要分支-Bounded constrained optimization problem is the main type of optimization, and it is the main branch of the optimization direction.
intPorg
- 整数规划；分支定界实现整数求解 首先需要建好模型(Integer programming; branch and bound to achieve integer solution, we first need to build model)
旅行商
- 利用分支界限算法实现旅行销售商问题的分支限界算法(Branch and bound algorithm for the traveling salesperson problem)
分支定界
- 实现VRP问题的分支定界算法，C语言实现，(A branch and bound algorithm for the realization of VRP problem)
运筹学整数规划分支定界法MATLAB实现（中文注释）
- 运筹学整数规划和分支定界的matlab实现！(Integer programming and branch and bound)
用分枝定界法求解整数线性规划问题
- matlab代码，用分枝定界法求解整数线性规划问题。(Matlab code, use the branch and bound method for solving integer linear programming problem.)
分支定界法
- 分支定界法的matlab实现，大家可以看看，学习学习(Matlab implementation of branch and bound method)
Algorithm
- 01背包，批处理作业调度，动态规划，回溯，分支限界(01 knapsack, batch job scheduling, dynamic programming, backtracking, branch and bound.)
MATLAB
- matlab中的分支定界法（包括了主流的各类算法经典文件）(matlab Branch and bound method (including all kinds of the mainstream algorithm classic file))
分枝限界算法
- 分支定界算法， 分支定界算法 分支定界算法 branch and bound(this is a branch and bound)