A labelling algorithm to solve the assignment problem

This paper describes a simple labeling algorithm to solve the assignment problem. The labeling approach is based on the maximum-flow formulation of the problem of finding the fewest number of lines to cover all zeros in the reduced assignment matrix. The approach is useful for educational purposes as well as programming environments. The labeling procedure can be used without requiring familiarity with the maximum-flow problem.