Abstract
AbstractWe present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subproblem can be contracted to a problem on a much smaller graph. We then solve these problems using the simplex method. We test the algorithm on benchmark instances, and show its improvement over the usual simplex algorithm. © 2007 Wiley Periodicals, Inc. NETWORKS, 2008
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.
