Description: Matlab demo code for the cyclic order preserving assignment problem with application to shape matching-Matlab demo code for the cyclic order prese rving assignment problem with application to s CPR matching Platform: |
Size: 36765 |
Author:Zhenhua |
Hits:
Description: 0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。另：胡运权所著的《运筹学基础及应用（第三版）》第97页的例3，我用本程序求解得到的结果是：最优解是x*=(1,0, 0, 0, 0)，最优值是f(x*)=8，但书求得最优解是x*=(1,0, 1, 0, 0)，最优值是f(x*)=4，是不是书中写错了，请大家验证。以下是源程序，大家可以任意使用无版权问题，另外，如果大家有大规模的0-1规划的问题也希望提供给我，谢谢。变量个数至少是3个-0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source Platform: |
Size: 1024 |
Author:wan |
Hits:
Description: Matlab demo code for the cyclic order preserving assignment problem with application to shape matching-Matlab demo code for the cyclic order prese rving assignment problem with application to s CPR matching Platform: |
Size: 36864 |
Author:Zhenhua |
Hits:
Description: 目标分配问题，雷达目标识别，图象分割等最优控制问题等matlab遗传算法优化应用-Target Assignment Problem, radar target recognition, image segmentation, such as optimal control problems, such as the application of genetic algorithm matlab Platform: |
Size: 4096 |
Author:熊梅西 |
Hits:
Description: 用Kruskal算法构造最小生成树解决指派问题（assignment problem）
一家公司经理准备安排 名员工去完成 项任务，每人一项。由于各员工的特点不同，不同的员工去完成同一项任务时所获得的回报是不同的。如何分配工作方案可以使总回报最大？
-Kruskal Algorithm used to solve assignment problem minimum spanning tree (assignment problem), a manager of the company prepare arrangements for employees to complete tasks, each one. As a result of the characteristics of different staff, different staff to accomplish the same mission when the return is different. How to allocate the work program can make the greatest total return? Platform: |
Size: 230400 |
Author:liuzhi |
Hits:
Description: 运筹学ppt考试复习专用
第一章 线性规划与单纯形法
第二章 线性规划的对偶理论
第三章 整数规划
第四章 目标规划
第五章 运输与指派问题
第六章 网络模型-Operational research ppt exam review chapter dedicated linear programming and simplex method chapter on linear programming duality theory of integer programming in Chapter III Chapter IV Chapter V programming transportation and assignment problem in Chapter VI network model Platform: |
Size: 188416 |
Author:jane |
Hits:
Description: 国外蚁群优化算法用于二次分配问题（勿用于商业目的）-Foreign ant colony optimization algorithm for quadratic assignment problem (not to be used for commercial purposes) Platform: |
Size: 2048 |
Author:吴受章 |
Hits:
Description: The cross-entropy (CE) method attributed to Reuven Rubinstein is a general Monte Carlo approach to combinatorial and continuous multi-extremal optimization and importance sampling. The method originated from the field of rare event simulation, where very small probabilities need to be accurately estimated, for example in network reliability analysis, queueing models, or performance analysis of telecommunication systems. The CE method can be applied to static and noisy combinatorial optimization problems such as the traveling salesman problem, the quadratic assignment problem, DNA sequence alignment, the max-cut problem and the buffer allocation problem, as well as continuous global optimization problems with many local extrema. Platform: |
Size: 3072 |
Author:suci ariani |
Hits:
Description: assingment problem
With this package, I provide some MATLAB-functions regarding the rectangular assignment problem. This problem appears for example in tracking applications, where one has M existing tracks and N new measurements. For each possible assignment, a cost or distance is computed. All cost values form a matrix, where the row index corresponds to the tracks and the column index corresponds to the measurements. The provided functions return an optimal or suboptimal assignment - in the sense of minimum overall costs - for the given matrix. Platform: |
Size: 18432 |
Author:huan |
Hits:
Description: 利用MATLAB解决了指派问题的匈牙利算法-The assignment problem is solved by Hungarian algorithm used MATLAB Platform: |
Size: 7168 |
Author:deng wei |
Hits:
Description: 一些基本的线性规划问题，如风险投资问题和指派问题的Matlab的解法-Some basic linear programming problem, Matlab' s solution, such as venture capital issues and assignment problem Platform: |
Size: 2048 |
Author:James |
Hits:
Description: 关于指派问题的Matlab文档，希望对你有所帮助！-Documentation on Matlab assignment problem, I hope for your help! Platform: |
Size: 3082240 |
Author:yueyanan |
Hits:
Description: 此程序可以简单地解决0-1指派问题，可以分别求解目标函数最大值或最小值问题(This program can simply solve the 0-1 assignment problem, and can respectively solve the maximum or minimum of the objective function) Platform: |
Size: 1024 |
Author:JackeeY
|
Hits:
Description: 指派问题利用matlab的非线性规划模型求解(The assignment problem is solved by using the nonlinear programming model of MATLAB) Platform: |
Size: 269312 |
Author:程序猿_2
|
Hits:
Description: 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 fact, TSP problem is also a 0-1 problem. Of course, these problems are NP problems. For large-scale problems, exhaustive method is unable to find the optimal solution in an acceptable time. This program is only an exercise, and the proud point is that all solutions are arranged by recursive method. Come out.) Platform: |
Size: 2048 |
Author:末光 |
Hits:
Search - assignment problem matlab