On Finding a Maximal Assignment

A. Yaspan
Additional contact information
A. Yaspan: Polytechnic Institute, Brooklyn, New York

Operations Research, 1966, vol. 14, issue 4, 646-651

Abstract: An algorithm is presented and justified for finding a feasible assignment of the largest possible size among the zero elements of a matrix consisting partly of zeros and partly of nonzero elements. The problem comes up at each stage of the Hungarian method for solving the assignment problem. The solution differs from other published versions following the same principle in that it is elementary yet completely specific.

Date: 1966
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.4.646 (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:14:y:1966:i:4:p:646-651

Access Statistics for this article

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