Affiliation:
1. Institute of Management Technology, Nagpur, India
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.
Subject
Information Systems and Management,Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Information Systems,Management Information Systems
Reference25 articles.
1. Solving linear bottleneck assignment problems via strong spanning trees
2. A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
3. Fischetti, M. (1995). Lezioni di Ricerca Operativa. Italia: Edizioni Libreria Progetto Padova.
4. Gross, O. (1959). The bottleneck assignment problem. Rand Report, 1630.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献