搜索资源列表
lpsolve
- matlab整数规划工具箱-Matlab Toolbox
整数规划法
- 本程序是在原来的单纯形法基础上改进的,主要用于分枝界定法求解的整数规划。 修正的地方： １．运用勃兰特原则 ２.人机互动-this procedure is in the original simplex method on the basis of improvement, mainly for Mycobacterium defined method of integer programming. The amendme
lp_solve_4.0.tar
- 利用c语言编写，编译成动态链接库而成的matlab整数规划工具箱,包含c语言源程序，-use of language, compiled DLL from the Matlab Integer Programming Toolbox contains language source c,
MATLABfzkj
- matlab解用分支定界法解整数规划的程序。请大家参考-solutions using Matlab branch and bound method for integer programming procedures. Please refer
CUMCM_prize
- 整数规划的一个求解方法（得到CUMCM一等奖）主要思想：找最大元之后的逐步互换求解，有点类似遗传算法-an Integer Programming Solution (with Into First Class) main ideas : after finding the greatest element gradually swap solution, it is somewhat similar genetic algorithm
0-1programming
- 0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。另：胡运权所著的《运筹学基础及应用（第三版）》第97页的例3，我用本程序求解得到的结果是：最优解是x*=(1,0, 0, 0, 0)，最优值是f(x*)=8，但书求得最优解是x*=(1,0
ElementAlloc
- 用元素分配法求解0-1整数规划问题，比匈牙利法简单且易实现，该算法已通过实例验证-elemental distribution method 0-1 integer programming problems than Hungary and France is simple to implement, The algorithm has been verified by examples
bnb
- matlab 实现的整数规划工具箱，用起来挺方便的-Matlab achieve the integer programming toolbox, together with quite convenient
bnb20
- MatLab求解整数规划的一个工具箱， 有需要的吗-MatLab Solving Integer Programming a toolbox, the needy?
MATLAB_FD
- 整数规划的分枝定界法在MATLAB中的实现-integer programming branch of the profession in the realization of MATLAB
zhengshuguihua
- 一般来说，matlab中没有现成的工具箱来解决整数规划问题，但可以利用分支界定法来编程实现-Generally speaking, matlab no ready-made kit to solve the integer programming problem, but can use the branch as defined in law to Programming
matlabforGA
- matlab遗传算法程序，解决飞线性整数规划-matlab genetic algorithm procedure to solve linear integer programming to fly
ipslove
- 整数规划工具箱 解压后 调用ipslv_mex（）函数求解整数规划问题，经过本人测试，只能在matlab6.5以下的版本用-Integer programming toolkit called after decompression ipslv_mex () function for solving integer programming problems, after my testing, only in the followi
整数规划粒子群算法
- 用于求解整数规划的粒子群算法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 restricte
整数规划
- 建立优化模型，确定优化变量，利用整数规划算法进行优化，仿真结果图片显示。(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 disp
第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 var
穷举法求解0-1整数规划的matlab程序
- 0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。(0-1 integer programming has a very wide application background, such as assignment problem, k