Assignment Problem In our third example of a problem that can be solved by exhaustive search, there are n people who need to be assigned to execute n jobs, one person per job. (That is, each person is assigned to exactly one job and each job is assigned to exactly one person.) The cost that would accrue if the i th person is assigned to the j th job is a known quantity C[i,j] for each pair i,j=1,2,,n. The problem is to find an assignment with the minimum total cost. A small instance of this problem follows, with the table entries representing the assignment costs C[i,j] : Assignment Problem In our third example of a problem that can be solved by exhaustive search, there are n people who need to be assigned to execute n jobs, one person per job. (That is, each person is assigned to exactly one job and each job is assigned to exactly one person.) The cost that would accrue if the i th person is assigned to the j th job is a known quantity C[i,j] for each pair i,j=1,2,,n. The problem is to find an assignment with the minimum total cost. A small instance of this problem follows, with the table entries representing the assignment costs C[i,j]