Abstract
AbstractThe undirected multicommodity flow problem is encountered in the solution to traffic‐scheduling problems related to computer, communication, railroad, and other networks. We show how to formulate this problem as a piecewise linear optimization problem (with piecewise linear convex functions in both the objective and the constraints). We discuss how EMNET, a primal basis partitioning simplex algorithm, was modified so as to efficiently solve these problems using a pricing procedure that we call “shortest path pricing.” Extremely good solution times for some very large problems are presented. The solutions are not only obtained quickly, but also with a fraction of the number of pivots that are needed for the standard simplex method. © 2001 John Wiley & Sons, Inc.
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.
