搜索资源列表
Benders_Decomposition
- 一个好的最短路径算法参考文献——A benders decomposition approach-A benders decomposition approach for the robust shortest path problem with interval data.
Benders
- 应用Benders分解算法解决混合整数规划问题-Application Benders decomposition algorithm to solve mixed integer programming problems
BendersDecomposition
- 应用Benders分解算法求解混合0-1规划。对于研究非线性规划的同学很有益。-Application Benders decomposition algorithm for mixed 0-1 programming. Very useful for the study of nonlinear programming students.
BendersDecomposition
- 用benders分解法求解0-1整数规划问题-0-1 integer programming problem using benders decomposition method
Benders
- this program is benders method in math
benders
- bendes decomposition is an algorithm in gams
BendersDecomposition
- BENDERS分解算法，用来求解MIPS，即混合整数线性规划问题。我已经做了注释。-Benders decomposition of solving MIPS problem, which is mixed integer linear programming, I have done Notes
1
- 主要是针对matlab编程的14个案例； 案例1：一般区域二重、三重积分； 案例2：被积函数含有积分项的一类积分； 案例3：一般区域n重积分； 案例4：蒙特卡洛法计算n重积分； 案例5：第二类Fredholm积分方程； 案例6：第一类Fredholm积分方程； 案例7：第二类Volterra积分方程； 案例8：第一类Volterra积分方程； 案例9：全局优化； 案例10：fsolve求非线性方程组； 案例11：渐变光波求导； 案例12：遗传算法在复杂系统可靠度和冗余度分
cplexbilp.m
- 这是一个BENDERS 分解的MATLAB 文件(this is a Benders solution document)
Up-load
- Application of benders cut in power flow problem solving in electrical networks. Neural network for application with wind series Ant colony in the electrical circuit solution
IEEE 30 bus system data
- IEEE 30 BUS SYSTEM Comparisons between stochastic and deterministic Unit Commitment solutions are provided. The generation of Unit Commitment solution is guaranteed by DEEPSO, which is a hybrid DE-EA-PSO algorithm, where DE stands for Differential
Current methods and advances in forecasting
- Comparisons between stochastic and deterministic Unit Commitment solutions are provided. The generation of Unit Commitment solution is guaranteed by DEEPSO, which is a hybrid DE-EA-PSO algorithm, where DE stands for Differential Evolution, EA for
two-stage robust optimization
- 我们提出了一种列和约束生成算法来解决两阶段鲁棒优化问题。 与现有的Benders式切割平面方法相比，柱式和约束生成算法是一种通用的程序，采用统一的方法来处理最优性和可行性。 对两阶段稳健位置传输问题的计算研究表明，它的执行速度提高了一个数量级。(we present a column-and-constraint generation algorithm to solve two-stage robust optimization problems. Compared with existing
benders解法
- bender是解法案例，benders分解算法，求优化问题min cx+dy s.t.Ax+By>b