thatguy2048

thatguy2048 / AssignmentBranchAndBound / 0.1.0

README.md
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
Person 0     13     4     7     6
Person 1     1     11     5     4
Person 2     6     7     2     8
Person 3     1     3     5     9

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[].

Output: [1,3,2,0]
Meaning: 
Person 0 -> Job 1
Person 1 -> Job 3
Person 2 -> Job 2
Person 3 -> Job 0