Abstract
Capacitated transshipment problems constitute the most general class of single commodity network flow problems. During the last ten years the emphasis has shifted away from the primal-dual solution methods back to specializations of the primal simplex algorithm as the more efficient approach. In this survey numerous variations in data structures, selection rules and implementations of individual steps are extracted from the relevant literature. The exposition is centered around one basic algorithm which is explained in complete detail with particular attention to the intricacies of the basis exchange part. Specialized solution methods for transportation and assignment problems are taken into account.
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.
