A push/relabel framework for submodular flows and its refinement for 0-1 submodular flows

Optimization

Volumn 38, Issue 2, 1996, Pages 133-154

  Fujishige, S ^a   Zhang, X ^b  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

0 1 flows; Algorithm; Push relabel; Scaling; Submodular flows

Indexed keywords

EID: 0039334462     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331939608844244     Document Type: Article

References (23)

1. Cui, W. and Fujishige, S. (1988) A primal algorithm for the submodular flow problem with minimum-mean cycle selection. Journal of the Operations Research Society of Japan, 31, 431-440
2. Cunnigham, W. H. and Frank, A. (1985) A primal-dual algorithm for submodular flows. Mathematics of Operations Research, 10, 251-262
3. Edmonds, J.(1970) Submodular functions, matroids, and certain polyhedra. Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications (R. Guy, H. Hanani, N. Sauer and J. Schönheim, eds., Gordon and Breach, New York), 69-87
4. Edmonds, J. and Giles, R. (1977) A min-max relation for submodular functions on graphs. Annals of Discrete Mathematics, 1, 185-204
5. Frank, A. (1981) How to make a digraph strongly connected. Combinatorica, 1, 145-153
6. Frank, A. (1982) An algorithm for submodular functions on graphs. Annals of Discrete Mathematics, 16, 189-212
7. Frank, A. (1992) Augmenting graphs to meet edge-connectivity requirements. SIAM Journal of Discrete Mathematics, 5, 25-53
8. Frank, A. and Tardos, É (1987) An application of the simultaneous approximation in combinatorial optimization. Combinatorica, 7, 49-65
9. Fujishige S. (1978) Algorithms for solving the independent-flow problems. Journal of the Operations Research Society of Japan, 21, 189-204
10. Fujishige, S. (1986) A capacity-rounding algorithm for the minimum cost circulation problem- A dual framework of the Tardos algorithm. Mathematical Programming, 35, 298-308
11. Fujishige S. (1991) Submodular Functions and Optimization (North-Holland, Amsterdam)
12. Fujishige, S. Röck H. and Zimmermann, U. (1989) A strongly polynomial algorithm for minimum cost submodular flow problems. Mathematics of Operations Research, 14, 60-69
13. Fujishige, S. and Zhang, X. (1992) New algorithms for the intersection problem of submodular systems. Japan Journal of Industrial and Applied Mathematics, 9, 369-382
14. Fujishige, S. and Zhang, X. (1995) An efficient cost scaling algorithm for the independent assignment problem. Journal of the Operations Research Society of Japan, 38, 124-136
15. Gabow, H. N. (1993) A framework for cost-scaling algorithms for submodular flow problems. Technical Report No. CU-CS-661-93, Computer Science Department, University of Colorado, (1993)
16. Gale, D. (1957) A theorem of flows in networks. Pacific Journal of Mathematics, 7, 1073-1082
17. Goldberg, A. V. and Tarjan, R. E. (1990) Finding minimum-cost circulations by successive approximation. Mathematics of Operations Research, 15, 430-466.
18. Iri, M. and Tomizawa, N. (1976) An algorithm for finding an optimal "independent assignment". Journal of the Operations Research Society of Japan, 19, 32-57
19. Lucchesi, C. and Younger, D. H. (1978) A minimax relation for directed graphs. Journal of the London Mathematical Society, 17, 369-374
20. Shigeno, M. and Iwata, S. A cost-scaling algorithm for 0-1 submodular flows. Discrete Applied Mathematics (to appear)
21. Wallacher, C. and Zimmermann, U. (1994) A polynomial cycle canceling algorithm for submodular flows. Preprint
22. Zhang, X. (1994) Algorithms for network flow problems with matroidal and submodular constraints. Ph.D. Thesis, Doctoral Program in Socio-Economie Planning. University of Tsukuba
23. Zimmermann, U. (1992) Negative circuits for flows and submodular flows. Discrete Applied Mathematics, 36, 179-189