A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory. Series B

Volumn 80, Issue 2, 2000, Pages 346-355

  Schrijver, Alexander ^a,b  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034311821     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2000.1989     Document Type: Article

References (15)

1. Bixby R. E., Cunningham W. H., Topkis D. M. The partial order of a polymatroid extreme point. Math. Oper. Res. 10:1985;367-378.
2. Cunningham W. H. Testing membership in matroid polyhedra. J. Combin. Theory Ser. B. 36:1984;161-188.
3. Cunningham W. H. On submodular function minimization. Combinatorica. 5:1985;185-192.
4. Edmonds J. Submodular functions, matroids, and certain polyhedra. Guy R., Hanani H., Sauer N., Schönheim J. Combinatorial Structures and Their Applications. Proceedings Calgary International Conference on Combinatorial Structures and Their Applications, Calgary, Alberta, June 1969. 1970;69-87 Gordon and Breach, New York.
5. Frank A. Finding feasible vectors of Edmonds-Giles polyhedra. J. Combin. Theory Ser. B. 36:1984;221-239.
6. Fujishige S. Submodular Functions and Optimization. Annals of Discrete Mathematics. 47:1991;North-Holland, Amsterdam.
7. Grötschel M., Lovász L., Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica. 1:1981;169-197.
8. Grötschel M., Lovász L., Schrijver A. Geometric Algorithms and Combinatorial Optimization. 1988;Springer-Verlag, Berlin.
9. S. Iwata, L. Fleischer, and, S. Fujishige, A strongly polynomial-time algorithm for minimizing submodular functions, preprint, 1999.
10. Lawler E. L., Martel C. U. Computing maximal "polymatroidal" network flows. Math. Oper. Res. 7:1982;334-347.
11. Lovász L. Submodular functions and convexity. Bachem A., Grötschel M., Korte B. Mathematical Programming - The State of the Art (Bonn, 1982). 1983;234-257 Springer-Verlag, Berlin.
12. Picard J.-C. Maximal closure of a graph and applications to combinatorical problems. Management Sci. 22:1976;1268-1272.
13. Queyranne M. Minimizing symmetric submodular functions. Math. Programming. 82:1998;3-12.
14. Rhys J. M. W. A selection problem of shared fixed costs and network flows. Management Sci. 17:1970;200-207.
15. Schönsleben P. Ganzzahlige Polymatroid-Intesektions-Algorithmen. 1980;Eidgenössische Technische Hochschule Zürich.