Flow, matching and scheduling

0 of 8 topics done

Flow networks

1Read and model a directed flow networkOpen, set of 8START 2Validate a cut and calculate its capacityOpen, set of 8START 3Determine and certify maximum flowOpen, set of 8START

Matching and assignment

4Represent and solve a small bipartite matching problemOpen, set of 8START 5Find an optimum assignment with the Hungarian algorithmOpen, set of 8START 6Validate a cut and calculate its capacityOpen, set of 8START

Scheduling and critical path analysis

7Translate between precedence data and an activity networkOpen, set of 8START 8Complete a critical path analysisOpen, set of 8START 9Reduce project duration subject to crash limits and costsOpen, set of 8START 10Determine and certify maximum flowOpen, set of 8START