Journal Issues‎ > ‎Tilamsik, 8(1)‎ > ‎

Maximal Flow Algorithm Applied to the Delegation of Tasks during the Inter-Collegiate and Campuses Athletic Competition

Main Author: Pauline Jane M. Par
Bachelor of Science in Mathematics minor in Statistics

Co-Author: Josephine A. Camson, MAT
Department of Mathematics, BS Mathematics Program


Maximal Flow Algorithm was applied to assign tasks to major working committees for the Inter-Collegiate and Campuses Athletic Competition with the optimal number of committees involved in this activity during the A.Y. 2014-2015. Specifically, this aimed to present the existing assignments of major committees in ICCAC, to apply maximal flow algorithm and to find the optimal number of committees assigned in a specific task. Maximal flow problem was applied to every associated task involved in Inter-Collegiate and Campuses Athletic Competition to reduce the target time assigned to each task. Similarly, it also attempted to motivate the major working committees to focus on the major task and work efficiently with an optimal number of committees involved. Existing tasking of major committees in ICCAC was also presented, and several committees have parallel assignments which minimized tasks according to the nature of work. Through the maximal flow algorithm, time spend in performing the assigned task of every major working committees will be reduced and the idle time bound of every task will be minimized.

Keywords: maximal flow algorithm, tasking

Full Text: PDF
Philippine Copyright 2015

Ahuja R., Magnanti T., & Orlin J., (1993). Network flows: Theory, algorithms and applications. London: Prentice-Hall.

Das Purkayastha J. (2001). Project Network Diagrams: Important Tool for Project Time Management. Retrieved from

Parañaque Ma. T. (2001). Maximal Flow Algorithm Applied to the Assignment Problem of the Society of Applied Mathematics of UPLB. Los Baños: University of the Philippines.

Ryan C. (2000). Project Scheduling Essay, Research Paper. Retrieved on January 22, 2014 from http://