Deeksha Bhoon
NAACA
15. Hungarian Method is used to solve?
A. A transportation problem
B. A travelling salesman problem
C. A LP problem
D. Both a & b
Answers
Answered by
0
Explanation:
The Hungarian Algorithm is used to find the minimum cost in assignment problems that involve assigning people to activities. To use this algorithm, we start by organizing our data into a matrix with people as the rows and activities as the columns.
Similar questions