当前位置:
首页
资源下载
![](/images/right.gif)
搜索资源 - integer programming
搜索资源列表
-
0下载:
用割平面法求解整数规划。先不考虑整数约束条件,求松弛问题的最优解,如果获得整数最优解,即为所求,运算停止.如果所得到最优解不满足整数约束条件,则在此非整数解的基础上增加新的约束条件重新求解.-By cutting plane method for solving integer programming. Not considered integer constraints, the optimal solution relaxation problem, if the integer obtai
-
-
0下载:
DividePlane:用割平面法求解整数规划
-DividePlane: by cutting plane method for solving integer programming
-
-
0下载:
分支定界算法的GUI版用来解整数规划问题相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~
-
-
0下载:
整数规划,0-1整数规划,分支定界法求最优解-0-1 integer programming integer programming, branch and bound method for the optimal solution
-
-
0下载:
用于求解整数规划的matlab程序,有实例,通用性较强,可改动-For solving integer programming matlab program, there are examples of highly versatile, can be altered
-
-
0下载:
最优化问题中的整数规划问题,最优解需要是整数-Optimization problem of integer programming problems, the optimal solution requires an integer
-
-
0下载:
遗传算法解非线性问题,0-1整数规划,附图表,实例-Genetic Algorithm for Nonlinear 0-1 integer programming problems, drawing tables, examples
-
-
0下载:
用割平面法求解整数规划mat源程序,这个方法可以运行,用割平面法求解整数规划mat源程序,这个方法可以运行-By cutting plane method for solving integer programming mat source, this method can be run by solving integer programming source mat cutting plane method, this method can be run
-
-
0下载:
基于混合整数规划法的24节点26机系统的机组组合和最优出力问题-Based on a combination of 24 unit mixed-integer programming node 26 machine system problems and optimal output
-
-
0下载:
分支定界算法的GUI版用来解整数规划问题相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~
-
-
0下载:
键盘输入一个高精度的正整数N(此整数中没有‘0’),去掉其中任意S个数字后剩下的数字按原左右次序将组成一个新的正整数。编程对给定的N和S,寻找一种方案使得剩下的数字组成的新数最小。 输出应包括所去掉的数字的位置和组成的新的正整数。(N不超过240位) -Keyboard to enter a high-precision integer N (this is not an integer ' 0 ' ), which removed any remaining S-digit num
-
-
0下载:
用benders分解法求解0-1整数规划问题-0-1 integer programming problem using benders decomposition method
-
-
0下载:
基于单目标优化的车载物流分配等 可通过更改优化目标和约束条件 来求解实际问题 使用蒙特卡洛方法求解整数解-Based on the integer programming of single objective optimization of vehicle logistics program
-
-
0下载:
SIMPLE integer programming with pso
-
-
0下载:
求解约束优化,非线性最小二乘优化,线性优化,整数规划,二次规划等最优化问题-Solving constrained optimization, nonlinear least squares optimization, linear optimization, integer programming, quadratic programming and other optimization problems
-
-
0下载:
隐枚举法求解01整数规划问题,约束线性,目标函数线性-01 implicit enumeration method for solving integer programming problems, constraints linear, linear objective function
-
-
0下载:
通过键盘输入一个高精度的正整数n(n的有效位数≤240),去掉其中任意s个数字后,剩下的数字按原左右次序将组成一个新的正整数。编程对给定的n 和s,寻找一种方案,使得剩下的数字组成的新数最小。 -Through the keypad to enter a high-precision integer n (n significant digits ≤240), remove any of s digits, the remaining figures about the original ord
-
-
0下载:
大学生数学建模整数规划,MATLAB学习资料,含例题讲解-Mathematical modeling of integer programming, MATLAB learning materials, including examples explain
-
-
0下载:
了解数组的概念,掌握数组的声明、初始化方式,熟练掌握foreach语句的用法,理解params关键字的使用,掌握数组转换方法的使用,理解索引器的概念,掌握在整数索引和在字符串上索引的应用.
-Understand the concept of the array, the array of master declaration, initialization methods, proficiency foreach statement usage, understanding the use
-
-
0下载:
隐枚举法解整数规划,一开始先进行变量个数判断,小于三则直接遍历。-Implicit enumeration method for solving integer programming, beginning first performed to determine the number of variables, less than three directly traversal.
-
«
1
2
...
4
5
6
7
8
910
11
12
13
14
...
23
»