A capacity scaling algorithm for convex cost submodular flows

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 482-489

  Iwata, Satoru ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS;

CAPACITY SCALING; CONVEX COST FUNCTION; EXCHANGE CAPACITIES; MINIMUM COST; POLYNOMIAL ALGORITHM; SCALING SCHEMES; SUBMODULAR FLOW; SUBMODULAR FUNCTIONS;

COSTS;

EID: 79960105657     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

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