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 ...

A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, f, for assigning item j to bin i; and a separate packing constraint for each bin—i.e., ...