COMPUTER METHODS FOR THE ASSIGNMENT PROBLEM

The assignment problem is a kind of combinatorial optimization problems. There are many computer methods to the problem, such as enumeration,minimum cell, line （column） scan,increase and decrease analyses, branch and bound, Hungarian and its modified algorithm, etc..On the basis of analysing, summarizing and simulating these traditional methods, we use a stochastic parallel algorithm to solve the assignment problem, and compare them in time complexity and result.