当前位置：
首页 资源下载
搜索资源 - integer linear programming algorithm
搜索资源列表
-
6下载：
这是一个好的建模学习资料,赶快下载吧,
数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、
插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、
图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、
最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、
网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This a good model to study the information, downloa
-
-
0下载：
利用分支定届算法实现线性混合整数规划模型的求解（MATLAB代码）, using branch algorithm to solve the mixed integer linear programming model (MATLAB code)
-
-
0下载：
分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。
,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
-
-
17下载：
这是龚纯《精通MATLAB最优化计算》随书源码(M文件)。基于MATLAB优化工具箱，代码包含的内容有：牛顿法等无约束一维极值问题、单纯形搜索法等无约束多维极值问题、Rosen梯度投影法等约束优化问题、L-M法等非线性最小二乘优化问题、线性规划、整数规划、二次规划、粒子群优化、遗传算法。-This is pure Gong " Mastering MATLAB optimization calculations," with the book source (M file)
-
-
0下载：
数学建模比赛常用的算法,包括插值与拟合、线性规划、整数规划、动态规划、遗传算法等-Competition commonly used mathematical modeling algorithms, including interpolation and fitting, linear programming, integer programming, dynamic programming, genetic algorithm
-
-
0下载：
这个程序是基于matlab平台环境下编成的，数学计算方面的算法，包括动态规划算法，拉格朗日插值法，解非线性整数规划法，解线性规划，以及解常微分算法-This procedure is based on matlab platform into the environment, mathematics calculation algorithms, including dynamic programming algorithm, Lagrange interpolation, solution o
-
-
1下载：
本程序是基于非线性整数规划的遗传算法所编写的Matlab程序-This procedure is based on the non-linear integer programming genetic algorithm written Matlab program
-
-
1下载：
基于混合算法的均衡路程MTSP研究
给出了MTSP的整数线性规划模型、分类, 提出了均衡各旅行商访问路程和均衡各旅行商访问人数的多目标
问题针对均衡各旅行商访问路程的设计了相应的求解算法, 求解算法为遗传算法和一的混合算法给出了相应
的示例和实验结果, 并对实验结果的有效性进行了研究-Hybrid algorithm based on a balanced study of MTSP given distance of the MTSP integer linear programm
-
-
2下载：
考虑整数线性规划问题max（ci*xi）试设计一个解此问题的动态规划算法，并分析算法的计算复杂性-Consider the integer linear programming problem max (ci* xi) try to design a solution of this problem, dynamic programming algorithm, and analysis of algorithms computational complexity
-
-
0下载：
The solution of the Chinese postman problem using matching theory is given. The convex
hull of integer solutions is described as a linear programming polyhedron. This polyhedron is
used to show that a good algorithm gives an optimum solution. The
-
-
0下载：
Mixed integer linear programming source code
-
-
0下载：
用带线性松驰的分支定界算法求解混合整数线性规划问题的软件系统源代码-MINTO is a software system that solves mixed-integer linear programs by a branch-and-bound algorithm with linear programming relaxations.
-
-
0下载：
Gomory algorithm used to solve pure integer linear programming problems.
-
-
1下载：
精通MATLAB最优化计算 配套光盘
本书的主要内容是应用MATLAB来解决最优化问题，通过将“最优化问题”、“MATLAB优化工具箱”和“MATLAB编程”这三方面有机结合进行讲述，即一方面是使用工具箱来快速解决最优化问题，另一方面是通过算法编程深入解决最优化问题。主要包括MATLAB优化工具箱、无约束多维极值问题、约束优化问题、非线性最小二乘优化问题、线性规划、整数规划、二次规划、粒子群优化算法、遗传算法。
-The main contents of the book is the
-
-
0下载：
分支界定实现源程序,本程序用C语言实现，故依据C语言的语法，数字0表示甲城市，数字49表示乙城市.-This is a software system that solves mixed-integer linear programs by a branch-and-bound algorithm with linear programming relaxations.
-
-
0下载：
该书讲述了线性规划，整数规划，图与网络，排队论，对策论，层次分析法，插值与拟合，回归分析，常微分方程，现代优化算法的等等，是一个相当好的数学文档。-The book tells the story of linear programming, integer programming, drawing and networks, queuing theory, game theory, AHP, interpolation and fitting, regression analysis, ord
-
-
0下载：
This function solves the mixed integer linear programming problems. It
uses the linprog.m function that comes with the optimization toolbox
of MATLAB. It employs the branch and bound algorithm. It uses depth
first search.
-
-
0下载：
线性规划算法，整数规划及二次规划算法，经测试收敛较快，效果不错，需要非线性最优化的可以借鉴-Linear programming algorithm, integer programming, quadratic programming algorithm, tested converges faster, effect is good, need to nonlinear optimization can draw lessons from
-
-
0下载：
离散优化
*enum - 枚举法
*monte - 蒙特卡洛法
*lpint (BranchBound)- 线性整数规划
*L01p_e - 0-1整数规划枚举法
*L01p_ie - 0-1整数规划隐枚举法
*bnb18 - 非线性整数规划(在MATLAB5.3使用)
*bnbgui - 非线性整数规划图形工具(在MATLAB5.3使用)
*mintreek - 最小生成树kruskal算法
*minroute - 最短路dijkstra
-
-
0下载：
This paper considers the problem of hybrid flow shops with sublots and sequence dependent setup times to minimize the total tardiness. A mixed integer linear programming model is presented for the problem. The paper also proposes an imperialist compe
-
