A Probabilistic Approach to Solving Assignment Problems

Mehmet I. Celebiler
Additional contact information
Mehmet I. Celebiler: COMSAT Laboratories, Washington, D.C.

Operations Research, 1969, vol. 17, issue 6, 993-1004

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.

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.6.993 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:17:y:1969:i:6:p:993-1004

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().