搜索资源列表
运筹学单纯形算法
- 运筹学单纯形算法，对偶单纯形算法，和改进单纯形算法的程序。-tacticians simplex algorithm, dual simplex algorithm, and improve the simplex algorithm procedures.
运筹学最小支撑树求解
- 运筹学最小支撑树的求解方法。该程序共有两种计算方法，可以用不同方法求解出最小支撑树。也可以对求解过程进行单步执行，从而清楚看出算法的求解过程。-tacticians minimum spanning tree method of solution. There are two procedures for the calculation method can use a different method to solve the sma
运筹学最经典的解决后续问题的算法
- 运筹学最经典的解决后续问题的算法-tacticians classic follow-up to resolve the issue of the algorithm
清华大学《运筹学》教材相应的授课文档
- 清华大学《运筹学》教材相应的授课文档
LINDO(LINGO)解运筹学问题
- 好看呵，同志们 lindo/lingo-pretty, uh, comrades Lindo/lingo
2004418144849104
- 运筹学算法包C实现-tacticians packet algorithm to achieve C
yunchou
- 运筹学之模式搜索法及游泳问题！-tacticians search patterns and swimming!
yunchouxue
- 运筹学中常用到的算法-tacticians of the commonly used algorithms
运筹学界面源代码
- 适合初学vc,熟悉ide之用-suitable for beginners vc familiar with the use ide
运筹学最经典的解决后续问题的算法
- 运筹学最经典的解决后续问题的算法-tacticians classic follow-up to resolve the issue of the algorithm
tbb
- 单纯形法c++编程，以解决运筹学中线性规划问题，程序简单明了，对于初学者来说是一个很不错的选择-Simplex Method c programming, operations research to solve linear programming problems, procedures simple and clear, for a newcomer is a very bad choice
tbb2
- 单纯形法c编程，可用于运筹学线性规划问题的解决，优化问题-Simplex Method c programming, operations research can be used for linear programming problem-solving, optimization, etc.
lyp
- 运筹学中的解非线性规划问题的一种方法,zoutendijk可行方向法-tacticians solution of the nonlinear programming method, zoutendijk feasible direction
ma er ke fu
- 该程序完成马尔可夫分析，马尔可夫分析是运筹学中很重要的一个技术。-Markov analysis, operations research, Markov analysis is a very important one technology.
task
- 该程序用于计算任务分配问题，任务分配问题也是运筹学中一个较难的问题。-procedures used in the calculation of the distribution of tasks, task allocation problem is tacticians had a more difficult problem.
swr
- 这是关于运筹学，博弈问题的算法程序！您只要输入对策矩阵就性了-on tacticians, the game of the algorithm! Your input on the sexual response of the matrix
线性规划_单纯形
- 本程序使用VC++编写的,用于实现运筹学中的线性规划的单纯形法,开始数据以在程序开始进行初始化,主要是用来检验算法,具体数值可根据需要进行初始化-procedures for the use of the VC prepared for the realization of operational research, linear programming of the simplex method, the beginning of t
运筹学最小支撑树求解
- 运筹学最小支撑树的求解方法。该程序共有两种计算方法，可以用不同方法求解出最小支撑树。也可以对求解过程进行单步执行，从而清楚看出算法的求解过程。-tacticians minimum spanning tree method of solution. There are two procedures for the calculation method can use a different method to solve the sma
随机运筹学(赵玮)
- 随机运筹学(赵玮) 运筹学教程，适合本科生学习(Stochastic operations research (Zhao Wei))
运筹学整数规划分支定界法MATLAB实现（中文注释）
- 运筹学整数规划和分支定界的matlab实现！(Integer programming and branch and bound)