Abstract
Several computer programs that can implement the Out-of-Kilter algorithm have been written. To date programs have been written in Fortran, Algol, Pascal, Basic, C++ and Matlab. According to the knowledge of the author, a program to do this in R has not yet been written. The R program written in this article can solve both the maximum flow and minimum cost-maximum flow problems. Since the Out-of-Kilter algorithm has a network flow as input, it can also be used to solve the flow in any problem whose information can be presented in the form of a network flow. This includes among others the transportation problem, the assignment problem, the shortest route problem and the caterer problem.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call