Hungarian Method
Assignment Problem Solver
About This Method
The Hungarian Method (Kuhn-Munkres algorithm) solves assignment problems to optimally match workers to jobs, minimizing total cost or maximizing total profit. It uses row/column reduction and line covering to find the optimal assignment.
💡 Tip: Supports decimal values. Use - for prohibited assignments (treated
as very high cost).