An Exact Method to Find All Kth Best Solutions for an Assignment Problem
In this paper, we present a new method to find all (n!) solutions for a given n × n assignmentproblem.Thesesolutionscanbearrangedinanincreasingorder, therefore all K ranked solutions can be obtained, K≥2. The method has been programmed in C language and tested on 60 instances of different sizes, 4≤n≤20. Later performance quality of the random search method to find Kth best solutions is investigated for a given value of K.
Keywords - Ranked solutions, Assignment Problem, Kth Best Solution, Exact Method.