搜索资源列表
-
0下载：
Artificial Bee Colony Algorithm Review and Application to Generalized Assignment Problem
-
-
0下载：
这是一个匈牙利算法，非常有用，对于解决二次分配有帮助。-this code id designed for quasi-assignment, and it maybe helpful for some optimization problem.
-
-
1下载：
指派问题的匈牙利解法，从文件中读入待指派的数据。-Assignment problem of the Hungarian method, read from a file to be assigned to data.
-
-
0下载：
用匈牙利算法来解决最优的分配问题，比如路径或代价-hungarian algorithm to solve the assignment problem
-
-
0下载：
Intention based scoring (IBS) is a scoring system, its goal is to provide a score that more accurately assesses a student’s ability to solve a composition problem, and therefore assess direct effects of the student s programming ability. This process
-
-
0下载：
The assignment addresses the problem of encoding and decoding by on the basis of the frequency of the occurrence of the characters in a text through the creation of Huffmann tree.
-
-
0下载：
This source code solves the assignment problem in Bipartite graphs by implementing the Hungarian Algorithm.
-
-
0下载：
推销员问题：穷举出推销员可能行走的每条路径，计算花费，从中选出最小的那条路径，有很详细的注释，是我们算法课的作业。-Salesman problem: a salesman may exhaustive walk each path, calculate the cost, choose the smallest piece of the path, there are very detailed notes, our algorithm homework assignment.
-
-
0下载：
Code for quadratic assignment problem (QAP) written in Matlab
-
-
0下载：
采用匈牙利算法求解将N个任务分配给N个人，没人均有且仅有一个任务的指派问题-Hungarian algorithm using the task assigned to the N N individuals, not per capita has one and only one task assignment problem
-
-
0下载：
lingo解决TSP问题 最短路问题 分配问题（指派问题，Assignment Problem） lingo源代码-Examples lingo lingo principle to solve TSP source code
-
-
1下载：
一些基本的线性规划问题，如风险投资问题和指派问题的Matlab的解法-Some basic linear programming problem, Matlab' s solution, such as venture capital issues and assignment problem
-
-
0下载：
求解指派问题（N个人完成M项工作）的匈牙利算法，使用C++描述，VC6.0-Solving assignment problem (N individual items of work completed M) Hungarian algorithm using C++ descr iption, VC6.0
-
-
0下载：
使用匈牙利算法来解决指派问题，MATLAB代码(The Hungarian algorithm solves the assignment problem)
-
-
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
-
