Quick questions on Assignment and Matching - TCE Mathematics Applications (Tasmania)

1short Q&A pairs drawn directly from our worked dot-point answer. For full context and worked exam questions, read the parent dot-point page.

What are bipartite matching without costs?

Show answer

Not every assignment question carries a cost matrix. When the data is simply who can do what, the problem becomes a bipartite matching: workers on one side, tasks on the other, joined by an edge when that worker can do that task. The aim is a complete matching that pairs every worker with a task they can do, one to one. The practical method is to start with the most constrained vertex, the worker (or task) with the fewest options, and assign it first, then repeat with the next most constrained.

Have a question we have not covered?

This dot-point answer is short enough that we have not extracted many short questions yet. Read the full dot-point answer or ask Mo, our study assistant, in the chat for follow ups.