A capacity scaling algorithm for convex cost submodular flows

Mathematical Programming, Series B

Volumn 76, Issue 2, 1997, Pages 299-308

  Iwata, Satoru ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Convex optimization; Polynomial algorithm; Submodular flow

Indexed keywords

EID: 0008694731     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614442     Document Type: Article

References (11)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows - Theory, Algorithms, and Applications (Prentice Hall, NJ, 1993).
2. W.H. Cunningham and A. Frank, A primal-dual algorithm for submodular flows, Mathematics of Operations Research 10 (1985) 251-262.
3. J. Edmonds and R. Giles, A min-max relation for submodular functions on graphs, Annals of Discrete Mathematics 1 (1977) 185-204.
4. J. Edmonds and R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, Journal of the ACM 19 (1972) 248-264.
5. A. Frank, Finding feasible vectors of Edmonds-Giles polyhedra, Journal of Combinatorial Theory, Series B 36 (1984) 221-239.
6. A. Frank and E. Tardos, Generalized polymatroids and submodular flows, Mathematical Programming 42 (1988) 489-563.
7. S. Fujishige, Structures of polyhedra determined by submodular functions on crossing families, Mathematical Programming 29 (1984) 125-141.
8. S. Fujishige, Submodular Functions and Optimization (North-Holland, Amsterdam, 1991).
9. D.S. Hochbaum and J.G. Shanthikumar, Convex separable optimization is not much harder than linear optimization, Journal of the ACM 37 (1990) 843-862.
10. M. Minoux, Solving integer minimum cost flows with separable convex objective polynomially, Mathematical Programming Study 26 (1986) 237-239.
11. E. Tardos, C.A. Tovey and M.A. Trick, Layered augmenting path algorithms, Mathematics of Operations Research 11 (1986) 362-370.