navigation
search
Differences
This shows you the differences between two versions of the page.
|
cs-312:hw24 [2014/12/31 23:07] ringger created |
cs-312:hw24 [2014/12/31 23:25] (current) ringger |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| - | Branch and Bound for Job Assignment. In general, the Job Assignment problem involves <math>n</math> tasks and <math>n</math> agents. Each agent has a cost associated with its ability to complete each task. The goal is to assign each agent a unique task to minimize total cost. | + | Branch and Bound for Job Assignment. In general, the Job Assignment problem involves $n$ tasks and $n$ agents. Each agent has a cost associated with its ability to complete each task. The goal is to assign each agent a unique task to minimize total cost. |
| Given the following Job Assignment problem with agents A-D and tasks 1-4, | Given the following Job Assignment problem with agents A-D and tasks 1-4, | ||
