About this document
Maximal Flow Algorithm for Task Delegation by Jane Montero is a document available to read on EtoBox.
This document summarizes a research study that applied the maximal flow algorithm to optimize task assignments for committees involved in an inter-collegiate athletic competition. The study aimed to analyze existing task assignments, apply the maximal flow algorithm to determine the optimal number of committees for each task, and minimize the time spent on tasks. The maximal flow algorithm was used to find the maximum flow of committees from the source node to the sink node (completion of tasks) without exc
- Author
- Jane Montero
- Language
- EN