A Probabilistic Approach to Solving Assignment Problems
Published Online:1 Dec 1969https://doi.org/10.1287/opre.17.6.993
Abstract
Assignment problems arise whenever elements of a finite set have to be paired with elements of another finite set in such a way as to maximize a certain function of the pairing. In this paper three different formulations of such a problem are given. They are analyzed and a method for obtaining a low-cost solution is developed.
