Abstract
It is noted that the decomposition of a network presented by J.C. Picard and M. Queyranne through an algorithmic argument may be defined from a general lattice-theoretic result for more general problems for which the equalities of maximum-flow minimum-cut type hold.
This is a preview of subscription content, log in via an institution to check access.
References
J.C. Picard and M. Queyranne, “On the structure of all minimum cuts in a network and applications”,Mathematical Programming Study 13 (1980) 8–16.
G. Birkhoff,Lattice theory (Amer. Math. Soc., Providence, RI, 1967).
M. Iri, “Combinatorial canonical form of a matrix with applications to the principal partition of a graph”,Transactions of the Institute of Electronics and Communication Engineers of Japan 54A (1971) 30–37. [In Japanese.]
N. Tomizawa, “Strongly irreducible matroids and principal partitions of a matroid into strongly irreducible minors”,Transactions of the Institute of Electronics and Communication Engineers of Japan 59A (1976) 83–91. [In Japanese.]
M. Iri, “A review of recent work in Japan on principal partitions of matroids and their applications”,Proceedings of the second international conference on combinatorial mathematics, Annals of the New York Academy of Sciences 319 (1979) 306–319.
E.L. Lawler, “Matroid intersection algorithms”,Mathematical Programming 9 (1975) 31–56.
M. Iri and N. Tomizawa, “An algorithm for finding an optimal ‘independent assignment’”,Journal of the Operations Research Society of Japan 19 (1976) 32–57.
S. Fujishige, “Algorithms for solving the independent-flow problem”,Journal of the Operations Research Society of Japan 21 (1978) 189–203.
U. Zimmermann, “Minimization of some nonlinear functions over polymatroidal flows”, Report 81-5, Mathematisches Institut, Universität zu Köln, Köln, West Germany.
A. Schrijver,Matroids and linking systems, Mathematics Centre Tracts 88, Amsterdam (1978).
M. Nakamura and M. Iri, “Fine structures of matroid intersections and their applications”,Proceedings of the international symposium on circuits and systems, Tokyo, 1979, pp. 996–999.
M. Nakamura and M. Iri, “A structural theory for submodular functions, polymatroids and polymatroid intersections”, to appear.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nakamura, M. Boolean sublattices connected with minimization problems on matroids. Mathematical Programming 22, 117–120 (1982). https://doi.org/10.1007/BF01581030
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581030