Open AccessThe Hungarian Method for the Assignment Problem, With Generalized Interval Arithmetic and Its Applications
Author(s) -
D. Bhanu Priya,
G. Ramesh
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1377/1/012046
Subject(s) - assignment problem , interval (graph theory) , generalized assignment problem , weapon target assignment problem , hungarian algorithm , mathematical optimization , interval arithmetic , focus (optics) , linear programming , linear bottleneck assignment problem , quadratic assignment problem , mathematics , algorithm , computer science , optimization problem , combinatorics , mathematical analysis , physics , optics , bounded function
In this paper, we focus on the solution procedure for fully interval assignment problem (FIAP), Hungarian method is considered into account. In consideration method the given FIAP is decayed into Interval Assignment Problem, solving it with existing method and by using its optimal solutions, an optimal interval assignment solution to the given FIAP is obtained. Although the assignment problem can be solved as an ordinary transportation problem or as Linear programming problem, its unique structure can be exploited, resulting in special purpose algorithm, is called Hungarian method. A numerical example is provided to illustrate the solution procedure developed in this paper.