Question: Describe a Branch & Bound algorithm to solve the employee to project assignment reward problem. You are given n employees and n projects. You are
Describe a Branch & Bound algorithm to solve the employee to project assignment reward problem.
You are given n employees and n projects. You are also given an array A[i,j] which contains the revenue realized by that assignment of employee i to project j.
Describe your Branch & Bound solution to maximize the reward.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
