Assignment Problem's Algorithm And Its Realization

The assignment problem is important in the Operational Research. A fast polynomial algorithm is the famous so called "Hungarian algorithm". This dissertation points out the the popular algorithms on varies literatures are not right by examples. This dissertation also discusses the fundamental theory of the Hungarian algorithm for the assignment problem in detail and, and give a correct realization algorithm and its MATLAB routine. The routine is efficient and reliable under a great number of numerical tests.