Abstract
Recently, Ikura and Nemhauser proposed a polynomial-time algorithm for the transportation problem of the Hitchcock type by the dual simplex method. The Ikura-Nemhauser algorithm can also solve the general minimum cost flow problem by reducing the minimum cost flow problem to a Hitchcock problem. In this paper, instead of such a reduction, we show a polynomial-time dual simplex algorithm for finding a minimum cost flow in a two-terminal capacitated network by applying Ikura and Nemhauser's idea directly to general two-terminal networks.
Sign-in/Register to access full text options 
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 callMore From: Journal of the Operations Research Society of Japan
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.
