搜索资源列表
LINGO
- LINGO求解线性规划、整数规划、混合整数规划、二次规划和目标规划-Quot LINGO u6C2 u9E3 u7EBF u6027 u89C4 u5212 u3001 u6574 u6570 u89C4 u5212 u3001 u6DF7 u5408 u6574 u6570 u89C4 u5212 u3001 u4E8C u6B21 u89C4 u5212 u548C U76EE u6807 u89C4 u5212
GA
- 智能算法，求解线性规划，整数规划，最短路等优化算法，得到的解优化结果较好(Intelligent algorithm, solving linear programming, integer programming, shortest path optimization algorithm, the solution optimization results are better)
DVD lingo优化建模
- 关于DVD租赁方案的优化建模编程程序，关于整数规划和0-1规划(About the DVD rental program optimization modeling, programming procedures, on integer programming and 0-1 planning)
uzzz
- matlab 实现的整数规划工具箱,用起来挺方便的,不错的 很好(Integer programming of matlab toolbox, very convenient to use, good is very good)
scop
- 用于配电网的重构的混合整数二阶锥规划，利用yamilp工具箱，同时利用了cplex/mosek等求解器求解，配电网示例网架结构较简单。(The mixed integer two order cone programming is used in the distribution network reconfiguration, and the yamilp toolbox is used. At the same time, the cplex/mosek solver is used to
IntProgFZ
- 求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。(Branch and bound method)
.zip
- 整数规划,数学分析，Integer programming, mathematical analysis(Integer programming, mathematical analysis)
guangpan
- 无约束一维极值求解 无约束多维极值求解 线性规划 整数规划(unconstrained one-dimensional extremum)
pro_matlab_bb.m
- 分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。(Branch and bound (branch and bound) is one of the most commonly used algorithms for integer programming problems. This method can not only solv
《最优化理论与算法》－陈宝林
- 此书包含线性规划单纯形方法、对偶理论、灵敏度分析、运输问题、内点算法、非线性规划K-T条件、无约束最优化方法、整数规划和动态规划等。(This book includes linear programming, simplex method, duality theory, sensitivity analysis, transportation problem, interior point algorithm, nonlinear programming K-T condition, unc
遗传算法
- 现代遗传算法,求解非线性规划问题,整数规划问题,0-1整数规划问题(Genetic Algorithm ,solve the problem that nonlinear programming)
intPorg
- 整数规划；分支定界实现整数求解 首先需要建好模型(Integer programming; branch and bound to achieve integer solution, we first need to build model)
93184908
- 分支-切割法是把分支定界法与割平面法结合起来,用来求解混合整数规划问题,()
gcsy
- 线性规划模型与整数规划 线性规划模型与整数规划()
PSO, GA and many other optimization algorithms
- 包含一些常用的数学优化方法和高级的优化方法，如线性规划，整数规划，最小二乘法，GA，PSO等(A lot of mathmatical optimization algorithms such as linear programming, integer programming, least square method are included. In addition, improved GA and PSO are also included.)
lingo解题
- 一些题目的lingo解答，如目标运输，最小费用最大流，整数规划等(Lingo solutions for some topics, such as target transportation, minimum cost maximum flow, integer programming, etc.)
MILP_train_4
- 利用混合整数规划方法求解，目标是列车运行优化与控制(Solving the problem by mixed integer programming)
ga+TSP
- 由遗传算法开发的整数规划，车辆调度问题(Integer programming developed by genetic algorithm and vehicle scheduling problem)
aircargo_CG_2column
- 使用整数规划解决航空集装箱配载问题，目标函数是重心和目标值之间的距离。(Using integer programming to solve the problem of air container stowage. The objective function is the distance between the center of gravity and the value of the target)
matlab电力优化代码
- yalmip混合整数规划优化问题，电力生产安排问题。(This file provides matlab Matlab matlab tool combined with yalmip toolbox for power system optimization of the study. MATPOWER is powerful in power flow and in solving the best power flow. It is very important for power man