当前位置:
首页
资源下载
![](/images/right.gif)
搜索资源 - integer programming
搜索资源列表
-
0下载:
整数规划;分支定界实现整数求解 首先需要建好模型(Integer programming; branch and bound to achieve integer solution, we first need to build model)
-
-
0下载:
包含一些常用的数学优化方法和高级的优化方法,如线性规划,整数规划,最小二乘法,GA,PSO等(A lot of mathmatical optimization algorithms such as linear programming, integer programming, least square method are included. In addition, improved GA and PSO are also included.)
-
-
0下载:
规划中的变量(部分或全部)限制为整数时,称为整数规划。若在线性规划模型中,
变量限制为整数,则称为整数线性规划。(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
-
-
0下载:
一些题目的lingo解答,如目标运输,最小费用最大流,整数规划等(Lingo solutions for some topics, such as target transportation, minimum cost maximum flow, integer programming, etc.)
-
-
1下载:
利用混合整数规划方法求解,目标是列车运行优化与控制(Solving the problem by mixed integer programming)
-
-
1下载:
由遗传算法开发的整数规划,车辆调度问题(Integer programming developed by genetic algorithm and vehicle scheduling problem)
-
-
1下载:
运筹学整数规划和分支定界的matlab实现!(Integer programming and branch and bound)
-
-
1下载:
数学建模matlab规划类例子,包括线性规划、整数规划、目标规划、非线性规划等(Examples of mathematical modeling matlab planning, including linear programming, integer programming, goal programming, nonlinear programming, etc.)
-
-
0下载:
Short-term Hydro Scheduling using Integer Programming:
Management and Modelling Issues
-
-
2下载:
Cplex是一种用于GAMS (The General Algebraic Modeling System,通用代数建模系统)的求解器,它使得用户可以把GAMS(通用代数建模系统的)的高级建模功能跟Cplex优化器的优势结合起来。Cplex优化器是为能快速、最少用户干预地解决大型、复杂问题而设计的。求解线性、二次约束和混合整数规划问题的Cplex算法现在已提供访问(针对恰当的许可证)。尽管现存有多种求解工具,但是,GAMS/Cplex能自动地为特定问题计算最优值和设置大部分选项。(Cplex i
-
-
0下载:
解决整数规划的建模问题,可以较好的处理优化问题,并提供相关的实例及源程序(Solving integer programming modeling problems can better handle the optimization problems, and provide related examples and source programs.)
-
-
0下载:
% 离散优化
% *enum - 枚举法
% *monte - 蒙特卡洛法
% *lpint (BranchBound)- 线性整数规划
% *L01p_e - 0-1整数规划枚举法
% *L01p_ie - 0-1整数规划隐枚举法
% *bnb18 - 非线性整数规划(在MATLAB5.3使用)
% *bnbgui - 非线性整数规划图形工具(在MATLAB5.3使用)
% *mintreek - 最小生成树kruskal算法
% *minroute - 最短路dijkstr
-
-
0下载:
整数规划是指规划中的变量(全部或部分)限制为整数,若在线性模型中,变量限制为整数,则称为整数线性规划。目前所流行的求解整数规划的方法往往只适用于整数线性规划。(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
-
-
1下载:
利用有记忆的模拟退火算法求解非线性整数规划问题,在考虑到购物要求、分布均衡要求、经济效益、潜在利益、就业效益的情况下如何在北京奥运会主场馆周边地区建设商业点,满足奥运会期间的购物需求、分布基本均衡和商业上盈利。(The memory simulated annealing algorithm is used to solve the non-linear integer programming problem. Considering the shopping requirements, dis
-
-
1下载:
matlab求解vrpsd问题,解压可运行(HGA-for-VRPSD, The VRP is a well known integer programming problem which falls into the category of NP Hard problems, meaning that the computational effort required to solve this problem increases exponentially with the problem
-
-
1下载:
求解混合整数规划问题,将0-1分段函数变为线性约束(Solving Mixed Integer Programming Problem)
-
-
1下载:
其特色在于内置建模语言,提供十几个内部函数,可以允许决策变量是整数(即整数规划,包括 0-1 整数规划),方便灵活,而且执行速度非常快。能方便与EXCEL,数据库等其他软件交换数据。LINGO18.0为最新版本。(It is characterized by built-in modeling language, providing more than a dozen internal functions, allowing decision variables to be integers (
-
-
2下载:
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
-
-
2下载:
MATLAB遗传算法求解整数规划的最大值问题(A maximum of MATLAB genetic algorithm to solve the integer programming problem)
-
-
1下载:
非侵入式负荷分解技术,采用REDD数据集,辅助线性整数规划(An aided linear integer programming (ALIP) non-intrusive load monitoring (NILM) algorithm.)
-
«
1
2
...
7
8
9
10
11
1213
14
15
16
17
...
23
»