Abstract
In a feasible transportation problem, there is always an ordering of the arcs such that greedily sending maximal flow on each arc in turn, according to that order, yields a feasible solution. We characterize those transportation graphs for which there exists a single order which is good for all feasible problems with the same graph. The characterizations are shown to be intimately related to Monge sequences and to totally balanced matrices. We describe efficient algorithms which, for a given graph, construct such order whenever it exists. For a transportation problem with corresponding m× n bipartite graph with e arcs, we show how to generate such an order in O(min( e log e, mn)) steps. Using that order, the feasibility question for any given supply and demand vectors can be determined in O( m+ n) time. We also extend the characterization and algorithms to general minimum cost flow problems in which the underlying graph is nonbipartite, and the sources and destinations are not predetermined. We generalize the theory of Monge sequences too to such problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.