Open Access Open Access  Restricted Access Subscription Access

Hungarian Approach to Problem Solving for Assignments

Ravi Jain

Abstract


Task issue is a significant issue in math and is likewise talk about in truly actual world. In this paper we endeavor to present Hungarian strategy for taking care of task issue with calculation and arrangement steps. We inspect a mathematical model by utilizing Hungarian strategy .The Hungarian technique is an orderly method, simple to apply for taking care of task issue.


Full Text:

PDF

References


Harold W. Kuhn, "The Hungarian Method for the assignment problem", Naval Research Logistics Quarterly, 2: 83–97, 1955. Kuhn's original publication.

J. Munkres, "Algorithms for the Assignment and Transportation Problems", Journal of the Society for Industrial and Applied Mathematics, 5(1):32–38, 1957

March.

Jonker, R.; Volgenant, A. (December 1987). "A shortest augmenting path algorithm for dense and sparse linear assignment

problems". Computing. 38 (4): 325–

doi:10.1007/BF02278710.

Jain & Rawat, Optimization Techniques ,College Book Centre, Jaipur 2002.

Hira & Gupta ,Operations Research ,S. Chand Publication,2015.


Refbacks

  • There are currently no refbacks.