Abstract
We consider the minimum cost network flow problem subject to one side constraint. Three methods for solving such problems are presented and their computational efficiency is compared. The first method is a specialized primal simplex algorithm which exploits the underlying network structure. The second algorithm is a straight forward dual method which successively reduces the infeasibility of the side constraint. Finally, a Lagrangean approach is tested which uses a relaxation of the side constraint. Computational experience indicates that the specialized primal algorithm is superior to the other approaches for all but very small problems.
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.
