搜索资源列表
branch-and-cut-algorithm.rar
- 分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。 ,Branch and cut is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values. The method is
proficient-in-MATLAB-optimization
- 精通matlab最优化计算随书带的源码，包括线性规划，整数规划，pso，GA等-Proficient in matlab optimization calculation with the source code with the book, including linear programming, integer programming, pso, GA etc.
miqp
- 混合整数二次规划(MixedInteger QuadraticProgramming,MIQP)问题最优化问题源代码-source code of MIQP problem
lpsolve
- 数字仿真的lpsolve-整数规划工，matlab上使用，6.5以上版本，学习整数规划时很有用-Digital Simulation lpsolve-integer programming works, matlab used version 6.5 and above, learning is useful when the integer programming
Code_MATLAB_Optimization
- 这是龚纯《精通MATLAB最优化计算》随书源码(M文件)。基于MATLAB优化工具箱，代码包含的内容有：牛顿法等无约束一维极值问题、单纯形搜索法等无约束多维极值问题、Rosen梯度投影法等约束优化问题、L-M法等非线性最小二乘优化问题、线性规划、整数规划、二次规划、粒子群优化、遗传算法。-This is pure Gong " Mastering MATLAB optimization calculations," with the book source (M file)
brute-force-method
- 穷举法求解0-1整数规划的matlab程序-The brute-force method of solving 0-1 integer programming matlab program
PackingProblem
- 非线性整数规划问题，基于遗传算法的matlab程序-Nonlinear integer programming problems, based on genetic algorithm matlab program
matlabsuanfa
- 这个程序是基于matlab平台环境下编成的，数学计算方面的算法，包括动态规划算法，拉格朗日插值法，解非线性整数规划法，解线性规划，以及解常微分算法-This procedure is based on matlab platform into the environment, mathematics calculation algorithms, including dynamic programming algorithm, Lagrange interpolation, solution o
fenzhidingjieMATLAB
- 分枝定界法求解整数规划的MATLAB实现-Branch and Bound Method for Solving Integer Programming MATLAB to achieve
SimpMethodProj
- [数学问题]用分支定界发解线性混合整数规划问题，JavaSE swing 界面。-[Mathematical problem] Used branch and bound solution fat LMIP problem, JavaSE swing GUI.
BNBGUI
- 分支定界算法的GUI版 用来解整数规划问题 相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~
Tutorial_Modeling
- 建模教程 包含变分法，层次分析法，整数规划，图与网格等 附带MATLAB简介-Modeling Tutorial contains variational method, the level of analysis, integer programming, such as map and attached to the grid MATLAB Introduction
optimization
- 许多生产计划与管理问题都可以归纳为最优化问题, 最优化模型是数学建模中应用最广泛的模型之一,其内容包括线性规划、整数线性规划、非线性规划、动态规划、变分法、最优控制等. -matlab matlab matlab matlab optimization
zhengshuguihua
- 整数规划求解算法，《运筹学算法与编程实践-delphi实现》一书源代码，欢迎参考-Integer programming algorithm, " the practice of operations research algorithms and programming-delphi achieve" a book source code, please refer to
0-1guihua_yhmj
- 利用隐含枚举法求整数规划问题，《运筹学算法与编程实践-delphi实现》一书源代码，欢迎参考-The use of implicit enumeration method for integer programming problems, " the practice of operations research algorithms and programming-delphi achieve" a book source code, please refer to
Gomory
- 求解整数规划的问题可以解决一般的整数规划模型的解而且效率比较高！在matlab下调试通过-Solving integer programming problems can be solved in the general solution of integer programming model and more efficient! Adopted under the debugger in matlab
sas
- 本文提出了商业公司的订货问题，包括货物从工厂到仓库，再到分店销售两部分，是经济管理中的优化问题。根据改进的综合了贮存与运输的模型，我们建立了非线性整数规划模型进行求解，得出初步的优化订货及运输方案，并在问题2和问题3中增加了一些实际考虑因素，将问题拓展。-In this paper, the company' s orders for commercial issues, including goods from the factory to the warehouse, to sales
MonteCarto_MINLP
- 蒙特卡罗随机算法求解非线性整数规划的MATLAB程序-a MATLAB program using Monte Carlo algorithm to deal with a nonlinear integer programming model
fenzhijianding
- 实验目的：用Matlab实现分支定界法求解整数线性规划问题。 实验内容： 用分支定界法求下面的线性整数规划问题的最优解： -Experiment Objective: Matlab to achieve branch and bound method for solving integer linear programming problem. Experiment content: With the branch and bound method seek
fenzhijieding
- 分枝界定法的matlab程序,应用于数学模型的整数规划-Matlab program branches to define the law applied to integer programming mathematical model