搜索资源列表
-
1下载：
物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Sho
-
-
0下载：
分枝定界法求解整数规划的MATLAB实现-Branch and Bound Method for Solving Integer Programming MATLAB to achieve
-
-
0下载：
非线性整数规划算法，求解非线性整数规划活混合规划问题，常用的算法是分枝定界算法。基于该算法编成的现成函数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
-
-
0下载：
实验目的：用Matlab实现分支定界法求解整数线性规划问题。
实验内容：
用分支定界法求下面的线性整数规划问题的最优解：
-Experiment Objective: Matlab to achieve branch and bound method for solving integer linear programming problem.
Experiment content:
With the branch and bound method seek
-
-
0下载：
最优化问题中分枝定界法求解整数线性规划问题-Optimization of branch and bound method for solving integer linear programming problem
-
-
0下载：
matlab利用分支定界法求解整数规划的m函数文件，有详细的输入说明-matlab using the branch and bound method for solving integer programming m-function file, a detailed descr iption of the input
-
-
2下载：
分支定界法、割平面法、隐式枚举法的整数规划matlab源代码-The branch and bound method for, cut plane method, the method of implicit enumeration methods of integer programming matlab source code
-
-
1下载：
运用分枝定界法求解混合整数规划程序
各输入参数的含义：
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：初始可行解，无法找到初始可行解，默认为空
各输出参
-
-
0下载：
运用分枝定界法求解混合整数规划的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
-
