A minimum weight labelling method for determination of a shortest route in a non-directed network. - Santosh Kumar; Elias Munapo; Ozias Ncube; Caston Sigauke; Philimon Nyamugure (Int. J. Syst. Assur. Eng. Manag., 2013)

A transportation branch and bound algorithm for solving the generalized assignment problem. - Elias Munapo; 'Maseka Lesaoana; Philimon Nyamugure; Santosh Kumar (Int. J. Syst. Assur. Eng. Manag., 2015)

Solving the GAP by Cutting Its Relaxed Problem. - Elias Munapo; Trust Tawanda; Philimon Nyamugure; Santosh Kumar (ICO, 2022)

Maximum Flow by Network Reconstruction Method. - Elias Munapo; Trust Tawanda; Philimon Nyamugure; Santosh Kumar (ICO, 2022)

Modified TANYAKUMU Labelling Method to Solve Equality Generalized Travelling Salesman Problem. - Trust Tawanda; Philimon Nyamugure; Santosh Kumar; Elias Munapo (ICO, 2022)

Extreme Min - Cut Max - Flow Algorithm. - Trust Tawanda; Philimon Nyamugure; Elias Munapo; Santosh Kumar (Int. J. Appl. Metaheuristic Comput., 2023)

An intelligent node labelling maximum flow algorithm. - Trust Tawanda; Philimon Nyamugure; Santosh Kumar; Elias Munapo (Int. J. Syst. Assur. Eng. Manag., 2023)