Abstract
Ford and Fulkerson’s original 1956 max flow/min cut paper formulated max flow in terms of flows on paths, rather than the more familiar flows on arcs. In 1974 Hoffman pointed out that Ford and Fulkerson’s original proof was quite abstract, and applied to a wide range of flow problems. In this abstract model we have capacitated elements, and linearly ordered subsets of elements called paths. When two paths share an element (“cross”), then there must be a path that is a subset of the first path up to the cross and the second path after the cross. Hoffman’s generalization of Ford and Fulkerson’s proof showed that integral optimal primal and dual solutions still exist under this weak assumption. However, his proof is non-constructive.
Hoffman’s paper considers a sort of supermodular objective on the path flows, which allows him to include transportation problems and thus min-cost flow in his framework. We develop the first combinatorial polynomial algorithm that solves this problem, thereby also give a constructive proof of Hoffman’s theorem. Our algorithm accesses the network only through a dual feasibility oracle, and resembles the successive shortest path algorithm for ordinary min-cost flow. It uses some of the same techniques used to solve the max flow/min cut version of Hoffman’s model, plus a method to re-optimize when capacities change inside capacity scaling.
This work was partially supported by an NSERC Operating Grant, the DFG grants 444 USA 121/1/07, SK 58/4-1, and SK 58/5-3, and by the Graduate School of Production Engineering and Logistics, North Rhine-Westphalia.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Applegate, D.L., Cook, W.J., McCormick, S.T.: Integral Infeasibility and Testing Total Dual Integrality. OR Letters 10, 37–41 (1991)
Edmonds, J., Karp, R.M.: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. ACM 19, 248–264 (1972)
Ford Jr., L.R., Fulkerson, D.R.: Maximal Flow through a Network. Canadian J. of Mathematics 8, 399–404 (1956)
Frank, A., Tardos, É.: An Application of Simultaneous Diophantine Approximation in Combinatorial Optimization. Combinatorica 7, 49–65 (1987)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)
Hoffman, A.J.: A Generalization of Max Flow-Min Cut. Math. Prog. 6, 352–359 (1974)
McCormick, S.T.: A Polynomial Algorithm for Abstract Maximum Flow. UBC Faculty of Commerce Working Paper 95-MSC-001. In: An extended abstract appeared in Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 490–497 (1995)
McCormick, S.T.: Submodular Function Minimization. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Handbook on Discrete Optimization Ch. 7, pp. 321–391. Elsevier, Amsterdam (2006)
McCormick, S.T., Fujishige, S.: Strongly Polynomial and Fully Combinatorial Algorithms for Bisubmodular Function Minimization. In: Mathematical Programming; an extended abstract appeared in Proceedings of Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 44–53 (submitted, 2008)
Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, New York (1986)
Schulz, A.S., Weismantel, R., Ziegler, G.M.: 0/1-Integer Programming: Optimization and Augmentation are Equivalent. Technical Report No.441/1995, Fachbereich Mathematik, Technische Universität Berlin (1995)
Zadeh, N.: A bad network problem for the simplex method and other minimum cost flow algorithms. Mathematical Programming 5, 255–266 (1973)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martens, M., McCormick, S.T. (2008). A Polynomial Algorithm for Weighted Abstract Flow. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2008. Lecture Notes in Computer Science, vol 5035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68891-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-68891-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68886-0
Online ISBN: 978-3-540-68891-4
eBook Packages: Computer ScienceComputer Science (R0)