论文信息 - A capacity scaling algorithm for convex cost submodular flows

A capacity scaling algorithm for convex cost submodular flows

This paper presents a scaling scheme for submodular functions. A small but strictly submodular function is added before scaling so that the resulting functions should be submodular. This scaling scheme leads to a weakly polynomial algorithm to solve minimum cost integral submodular flow problems with separable convex cost functions, provided that an oracle for exchange capacities is available.

Satoru Iwata | S. Iwata

[1] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .

[2] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[3] András Frank,et al. Finding feasible vectors of Edmonds-Giles polyhedra , 1984, J. Comb. Theory, Ser. B.

[4] András Frank,et al. A Primal-Dual Algorithm for Submodular Flows , 1985, Math. Oper. Res..

[5] 藤重悟. Submodular functions and optimization , 1991 .

[6] Éva Tardos,et al. Layered Augmenting Path Algorithms , 1986, Math. Oper. Res..

[7] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[8] András Frank,et al. Generalized polymatroids and submodular flows , 1988, Math. Program..

[9] M. Minoux. Solving integer minimum cost flows with separable convex cost objective polynomially , 1986 .

[10] J. George Shanthikumar,et al. Convex separable optimization is not much harder than linear optimization , 1990, JACM.

[11] Satoru Fujishige,et al. Structures of polyhedra determined by submodular functions on crossing families , 1984, Math. Program..

[12] Remo Guidieri. Res , 1995, RES: Anthropology and Aesthetics.