搜索资源列表
[emuch.net]
- 非线性最小二乘优化问题、线性规划问题、整数规划问题、二次规划问题等-Nonlinear least squares optimization, linear programming, integer programming, quadratic programming problems
checkint
- 建立二叉树求解整数规划，非常实用，欢迎互相交流-Build binary integer programming solver, very practical, welcomed the exchange
NSGA-II
- 多目标整数规划的遗传算法NSGA-IImatlab源代码，主程序、初始化、计算适应度、排序、选择、交叉变异、重组，最后得到Pareto前言。可以跑通，下载即用，具体方法介绍博客上文章上都有。-Multi-objective integer programming genetic algorithm NSGA-IImatlab source code, the main program, initialization, calculate fitness, sorting, selection,
yichuansuanfachengxu
- 用遗传算法解决约束问题，最小二乘法优化问题，线性规划，整数规划，二次规划等-Genetic algorithm to solve constrained problems, least squares optimization, linear programming, integer programming, quadratic programming, etc.
bnb20
- bnb20是荷兰Groningen大学Koert Kuipers编写的解决一般非线性整数规划问题的工具包，非常好的工具。但是由于年代久远，经修改后可以在matlab2015上使用。-bnb20 solve Netherlands Groningen University Koert Kuipers prepared by the general nonlinear integer programming problem toolkit, very good tool. However, due
DFP
- MATLAB程序，解决01整数规划的DFP算法-MATLAB program to solve the DFP algorithm 01 Integer Programming
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)
IntProgFZ
- 求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。(Branch and bound method)
遗传算法
- 现代遗传算法,求解非线性规划问题,整数规划问题,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
- 线性规划模型与整数规划 线性规划模型与整数规划()
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
cplex翻译完全版
- Cplex是一种用于GAMS (The General Algebraic Modeling System，通用代数建模系统)的求解器，它使得用户可以把GAMS（通用代数建模系统的）的高级建模功能跟Cplex优化器的优势结合起来。Cplex优化器是为能快速、最少用户干预地解决大型、复杂问题而设计的。求解线性、二次约束和混合整数规划问题的Cplex算法现在已提供访问（针对恰当的许可证）。尽管现存有多种求解工具，但是，GAMS/Cplex能自动地为特定问题计算最优值和设置大部分选项。(Cplex i
整数规划
- 这是我曾经在数学建模中用到过的算法，拿来和大家一起分享(This is the algorithm I used to use in mathematical modeling to share with you)
32种算法
- 32种数学算法教程，算法入门优质资料。时间优化、时间序列、存储论等(32 algorithm tutorials, algorithm introduction of high quality information.)
YALMIP-master
- 耶鲁大学开发的可用于Matlab混合整数规划求解(Yalmip is the matlab toolbox for MILP problem from yal University,the Copyright owned by Johan Lfberg.)
simulate
- 利用有记忆的模拟退火算法求解非线性整数规划问题，在考虑到购物要求、分布均衡要求、经济效益、潜在利益、就业效益的情况下如何在北京奥运会主场馆周边地区建设商业点，满足奥运会期间的购物需求、分布基本均衡和商业上盈利。(The memory simulated annealing algorithm is used to solve the non-linear integer programming problem. Considering the shopping requirements, dis