搜索资源列表
dominate
- 用差分进化算法求解带有约束的混合整数规划问题-Using differential evolution algorithm for solving mixed integer programming with constraints problem
branchbound
- 高效线性整数规划求解matlab源程序，详细注释，完善测试-linear integer programming matlab source codes with detailed remarks and tests，
DividePlane
- 用割平面法求解整数规划。先不考虑整数约束条件，求松弛问题的最优解，如果获得整数最优解，即为所求，运算停止．如果所得到最优解不满足整数约束条件，则在此非整数解的基础上增加新的约束条件重新求解．-By cutting plane method for solving integer programming. Not considered integer constraints, the optimal solution relaxation problem, if the integer obtai
DividePlane
- DividePlane：用割平面法求解整数规划 -DividePlane: by cutting plane method for solving integer programming
mixed-integer-programming-problem
- 处理混合整数规划问题,可以方便计算整数规划问题-Handle mixed integer programming problem
zhengshuguihua
- 用于求解整数规划的matlab程序，有实例，通用性较强，可改动-For solving integer programming matlab program, there are examples of highly versatile, can be altered
BendersDecomposition
- 用benders分解法求解0-1整数规划问题-0-1 integer programming problem using benders decomposition method
zuiyouhua
- 求解约束优化，非线性最小二乘优化，线性优化，整数规划，二次规划等最优化问题-Solving constrained optimization, nonlinear least squares optimization, linear optimization, integer programming, quadratic programming and other optimization problems
L01
- 隐枚举法求解01整数规划问题，约束线性，目标函数线性-01 implicit enumeration method for solving integer programming problems, constraints linear, linear objective function
0-1matlab
- 穷举法求解0-1整数规划的matlab程序-0-1 LP based on matlab
fenzhidingjiefa
- 分支定界法能够用在处理整数规划问题中，是一种很经典的方法。希望大家有用！-Branch and bound method
linear-programming-algorithm
- 线性规划算法，整数规划及二次规划算法，经测试收敛较快，效果不错，需要非线性最优化的可以借鉴-Linear programming algorithm, integer programming, quadratic programming algorithm, tested converges faster, effect is good, need to nonlinear optimization can draw lessons from
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
PlanProblem
- 线性规划： CmpSimpleMthd(完整单纯形法) 整数规划(含0-1规划) DividePlane(割平面法) ZeroOneprog(枚举法) 二次规划 QuadLagR(拉格朗日法) ActivedeSet(起作用集法)-Linear Programming: CmpSimpleMthd (complete simplex method) Integer programming (including 0-1 Programming) Divide
branchbound
- 适用于整数规划中的分枝定界方法，比较常用的算法。参数说明在程序中写的很清楚了，欢迎大家下载使用。-Integar Optimization.
GA-knapsack-problem
- 使用遗传算法解决经典的背包问题，即整数规划问题。-Using genetic algorithm to solve the classic knapsack problem, that is, the problem of integer programming.
zhenshuguihua
- 史上最全的matlab整数规划源代码包含三个文件，三种方法-matlab OPTIMIZAM
GA
- matlab代码遗传算法解决背包问题，0-1整数规划问题-Genetic algorithm to solve knapsack problem, 01 integer programming problem
0-1-integer-problem
- 0-1整数规划 -运筹与优化MATLAB程序（源代码）- 0-1 integer programming - Operations Research and Optimization MATLAB program (source code)
Integer-Programming
- 详解MATLAB在最优化计算中的应用一书中第5章整数规划的例子源码-Detailed MATLAB in the optimization calculation of book Chapter 5 integer programming source code examples