Abstract
This article addresses the computational efficacy of applying steepest-edge criteria in a primal-dual algorithm for solving the minimum cost network flow problem. It is shown for the incremental primal-dual method, steepest-edge directions can be calculated directly without any additional data structures or computational overhead. The resulting implementation outperformed a network simplex code by over an order of magnitude in CPU time on medium sized problems from the NETGEN benchmark problem suite, and also compared favorably with the relaxation method on uncapacitated transportation and transshipment problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.