This paper describes a simple calculation for the assignment and transportation problems which is "dual to" the well-known Hungarian Method. While the Hungarian is a dual method, this method is primal ...

This paper presents a new algorithm for solving the assignment problem. The algorithm is based on a scheme of relaxing the given problem into a series of simple network flow (transportation) problems ...