Abstract
State-of-the-art computational results have shown that primal simplex algorithms are more efficient than primal-dual algorithms for general minimum cost network flow problems. There is, however, some controversy concerning their relative merits for solving assignment problems. This paper presents a detailed development for a computationally efficient primal-dual algorithm and extensive computational comparisons to primal simplex algorithms.
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 callDisclaimer: 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.
