Except for a few examples of each method, we have not discussed how we can apply these general techniques to solve specific problems.
Many problems require a combination of techniques for their solution.
The example problem shown below is called the Assignment Problem. In this problem you are to find a minimal cost assignment of jobs to workers. Assignment Problem Let C be an nxn matrix representing the costs of each of n workers to perform any of n jobs. The assignment problem is to assign jobs to workers so as to minimize the total cost. Since each worker can perform only one job and each job can be assigned to only one worker the assignments constitute an independent set of the matrix C .