Trust Tawanda

Orcid: 0000-0003-2665-9711

According to our database1, Trust Tawanda authored at least 7 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An intelligent node labelling maximum flow algorithm.
Int. J. Syst. Assur. Eng. Manag., August, 2023

Truck Fuel Consumption Prediction Using Logistic Regression and Artificial Neural Networks.
Int. J. Oper. Res. Inf. Syst., April, 2023

Extreme Min - Cut Max - Flow Algorithm.
Int. J. Appl. Metaheuristic Comput., 2023

2022
Modified TANYAKUMU Labelling Method to Solve Equality Generalized Travelling Salesman Problem.
ICO, 2022

Maximum Flow by Network Reconstruction Method.
ICO, 2022

Solving the GAP by Cutting Its Relaxed Problem.
ICO, 2022

2017
A node merging approach to the transhipment problem.
Int. J. Syst. Assur. Eng. Manag., 2017


  Loading...