Threshold assignment algorithm

The paper presents a new polynomially bounded assignment algorithm, called the threshold assignment algorithm. The algorithm is based on a new theorem concerning label-correcting shortest path algorithms. Preliminary computational findings indicate that the threshold assignment algorithm is much faster than the primal simplex algorithm for solving assignment problems.