This is an algorithm with uses the branch and bound method to solve the assignment problem.
Example: Assigning jobs to a group of people with the time to complete each job by each person known.
|Job 0||Job 1||Job 2||Job 3|
The input is the cost matrix for each person and job in the form of double. The output is each persons job assignment in the form of int.
Person 0 -> Job 1
Person 1 -> Job 3
Person 2 -> Job 2
Person 3 -> Job 0