论文信息 - A note on Frank's generalized polymatroids

A note on Frank's generalized polymatroids

Abstract A. Frank introduced a concept of generalized polymatroid. We show that a generalized polymatroid is a projection of a base polyhedron associated with a submodular system and discuss implication of this observation such as characterizations of faces, the intersection theorem and the greedy algorithm for generalized polymatroids.

Satoru Fujishige

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

[2] S. Fujishige,et al. A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES , 1983 .

[3] Refael Hassin,et al. Minimum cost flow with set-constraints , 1982, Networks.

[4] R. E. Bixby,et al. The Partial Order of a Polymatroid Extreme Point , 1985, Math. Oper. Res..

[5] A. Schrijver. Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions , 1984 .

[6] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..

[7] L. Shapley. Cores of convex games , 1971 .

[8] A. Frank. An Algorithm for Submodular Functions on Graphs , 1982 .

[9] S. Fujishige. Submodular systems and related topics , 1984 .

[10] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.