搜索资源列表
MATLAB 解整数规划 （分支定界)
- matlab解用分支定界法解整数规划的程序。请大家参考-solutions using Matlab branch and bound method for integer programming procedures. Please refer
IntProgFZ.rar
- 利用分支定界法求解整数规划问题，结果精确~~~~~,Using branch and bound method to solve integer programming problems, the results of precise ~~~~~
Discrete optimization
- 它包含了枚举法、蒙特卡洛法、线性整数规划、整数规划枚举法、整数规划隐枚举法、非线性整数规划、非线性整数规划图形工具、最小生成树kruskal算法、最短路dijkstra算法、最小生成树kruskal算法mex程序、最短路dijkstra算法mex程序和动态规划的代码。-It contains the matlab code of the enumeration method, Monte Carlo method, linear integer programming, integer prog
Iter
- 整数规划程序，好不容易找到哦，很不错，对编写单纯形法和整数规划都有参考价值-Integer planning process, hard to find Oh, very good, the preparation of the simplex method and integer programming have a reference value to
bnb20
- 在实际应用着经常需要求解非线性整数规划或混合规划问题，该领域中的一种常用的算法是分支定界(branch and bound)算法，但是matlab工具箱中没有相关的函数。荷兰Groningen大学的Koert Kuipers编写的的BNB20工具箱可以用来求解一般非线性整数规划问题-In practice, frequent need to solve nonlinear integer programming or mixed programming problem, the area a p
shuxueguihua
- 数学中经常用到的一些规划模型包含整数规划、线性规划、非线性规划-Frequently used for mathematical programming model contains a number of integer programming, linear programming, nonlinear programming
bnb20
- 非线性整数规划算法，求解非线性整数规划活混合规划问题，常用的算法是分枝定界算法。基于该算法编成的现成函数bnb20()-Nonlinear integer programming algorithm for solving nonlinear mixed integer programming live planning problem, commonly used algorithms are branch-and-bound algorithm. Based on the algorithm
Nonlinear Integer Programming Matlab Genetic Algorithm Procedure
- 本程序是基于非线性整数规划的遗传算法所编写的Matlab程序-This procedure is based on the non-linear integer programming genetic algorithm written Matlab program
xianxingzhengshuguihua
- 线性整数规划分支定界算法Matlab源码，算法简单有效-Linear integer programming branch and bound algorithm Matlab source code, algorithm is simple and effective
Integer_planning_brunch_and_bound_method
- 整数规划分支定界算法matlab通用源程序 各参数的意义同matlab优化工具箱的线性规划函数linprog -Integer_planning_brunch_and_bound_method
analysis
- 数模竞赛评审分析 优秀论文 非线形的整数规划模型-Analysis of digital-to-analog Contest outstanding papers integer non-linear programming model
linear-matlab
- 解整数规划的一系列程序,尤其是针对0-1规划.-Integer programming solution of a series of procedures, especially for 0-1 programming.
linearprogramming
- 利用mathematica、MATLAB解决线性规划，整数规划（0-1规划）的源代码-To solve the linear/integer/0-1 programming problems by mathematica or matlab
整数规划粒子群算法
- 用于求解整数规划的粒子群算法C++代码。(C++ code of particle swarm algorithm for Solving integer programming)
整数规划（（MATLAB+LINGO源码））
- 整数规划（（MATLAB+LINGO源码））(Integer programming ((MATLAB + LINGO source)))
第02章 整数规划
- 规划中的变量（部分或全部）限制为整数时，称为整数规划。若在线性规划模型中， 变量限制为整数，则称为整数线性规划。(In the planning of variables (partial or complete) restricted to integers, known as integer programming. If the linear programming model, Variables are restricted to integers is called intege
整数规划
- 建立优化模型，确定优化变量，利用整数规划算法进行优化，仿真结果图片显示。(The optimization model is established, the optimization variables are determined, the linear programming algorithm is used to optimize the results, and the simulation results are displayed.)
第02章 整数规划
- 解决整数规划的建模问题，可以较好的处理优化问题，并提供相关的实例及源程序(Solving integer programming modeling problems can better handle the optimization problems, and provide related examples and source programs.)
ch07 整数规划
- 整数规划是指规划中的变量（全部或部分）限制为整数，若在线性模型中，变量限制为整数，则称为整数线性规划。目前所流行的求解整数规划的方法往往只适用于整数线性规划。(Integer programming refers to the number of variables (all or part) in the planning that are limited to integers. In a linear model, the variables are limited to integers
穷举法求解0-1整数规划的matlab程序
- 0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。(0-1 integer programming has a very wide application background, such as assignment problem, knapsack problem and so on. In