Note on Assignment Algorithm with Easy Method of Drawing Lines to Cover All Zeros
Sarbjit Singh
Additional contact information
Sarbjit Singh: Institute of Management Technology, Nagpur, India
Authors registered in the RePEc Author Service: Sarbjit Singh Oberoi (sarbjitoberoi@gmail.com)
International Journal of Operations Research and Information Systems (IJORIS), 2012, vol. 3, issue 3, 87-97
Abstract:
The Assignment algorithm is around 54 years old and a lot of work has been done on this algorithm. In this study various aspect of assignment algorithm has been considered. The endeavor of this note is to make solution of assignment problem so simple that even class tenth student can easily solve it. One of the most important aspects of assignment algorithm (Hungarian Algorithm) is to draw lines to cover all the zeros, in this study a new and easy method has been proposed to cover all the zeros, which helps to make this algorithm easy.
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (3) Track citations by RSS feed
Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/joris.2012070106 (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:igg:joris0:v:3:y:2012:i:3:p:87-97
Access Statistics for this article
International Journal of Operations Research and Information Systems (IJORIS) is currently edited by John Wang
More articles in International Journal of Operations Research and Information Systems (IJORIS) from IGI Global
Bibliographic data for series maintained by Journal Editor (journaleditor@igi-global.com).