搜索资源列表
interg
- Lingo解决整数规划的PPT和应用实例-Lingo to solve integer programming PPT and application examples
Mintegera
- 通常matlab不能进行整数规划，现一一款混合整数的线形规划matlab m文件 -Usually matlab integer programming, now a mixed integer linear programming matlab m file
integer-programming
- 整数规划示例程序，包括整数规划所需的各个子程序-Integer Programming sample program, including integer programming required subroutine
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：初始可行解，无法找到初始可行解，默认为空 各输出参
intprog
- 整数规划matlab代码，代码简洁、效率高-Integer programming matlab code, the code is simple, high efficiency
chapter-11-integer-programming
- 利用matlab进行整数规划的源代码（精通matlab最优化计算第11章）-Integer programming source code using matlab
Benders
- 应用Benders分解算法解决混合整数规划问题-Application Benders decomposition algorithm to solve mixed integer programming problems
DividePlane
- 最经典的Gomory割平面法求解整数规划问题-The most classic Gomory cutting plane method for solving integer programming problems
ACONIP
- 该程序是本人写毕业论文时所编的用于求解整数规划的蚁群算法程序，愿与大家分享-The program is compiled when I write a thesis ant colony algorithm for solving integer programming procedures, and is willing to share with you
optimization-program
- 无约束一维极值/无约束多维极值/约束优化/非线性最小二乘优化/线性规划/整数规划/二次规划/遗传优化算法等对应的matlab程序-Unconstrained one-dimensional extremal/unconstrained multidimensional the pole/constrained optimization/nonlinear least squares optimization/linear programming/integer programming/Quadr
ZeroOneprog
- 零一法求解整数规划，matlab 零一法求解整数规划，matlab-zeroone for integer program
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
fxxzs
- 本例子为非线性整数规划的准确求解的有效方法之一。-The example of one of the accurate and effective method of solving nonlinear integer programming coefficients.
IntProgFZ
- 分支界限法求解整数规划，matlab 分支界限法求解整数规划，matlab-branch and cut with matlab
002
- 使用matlab语言编程解决整数规划问题-Using matlab language programming to solve the integer programming problem
lagrangian-relax
- 拉格朗日插值求解最优，适用于混合整数规划问题模型-Lagrange interpolation for solving optimal, suitable for mixed-integer programming problem model
fenzhidingjie
- 分支定界法，解决整数规划问题，很好的优化算法，可以学习-Branch and bound method to solve the problem of integer programming, a good optimization algorithm can learn
Integer-Programming
- 压缩文件附录了数学建模中，整数规划在具体应用中的源代码，并对建模本身进行了系统的介绍。-Elaborated on Grey System Studies, relevance and factors associated with the degree of how to quantify the problem is analyzed.
intprog
- 通过分支定界法计算线性规划、整数规划,效果较好。-To calculate integer programming, branch and bound method is better.
YALMIP
- 解整数规划问题的matlab程序包 能够很好地解决非线性规划问题-Solving of Integer Programming