Abstract.
U. Faigle and W. Kern have recently extended the work of their earlier paper and of M. Queyranne, F. Spieksma and F. Tardella and have shown that a dual greedy algorithm works for a system of linear inequalities with {:0,1}-coefficients defined in terms of antichains of an underlying poset and a submodular function on the set of ideals of the poset under some additional condition on the submodular function.¶In this note we show that Faigle and Kern’s dual greedy polyhedra belong to a class of submodular flow polyhedra, i.e., Faigle and Kern’s problem is a special case of the submodular flow problem that can easily be solved by their greedy algorithm.
Author information
Authors and Affiliations
Additional information
Received: February 1999 / Accepted: December 1999¶Published online February 23, 2000
Rights and permissions
About this article
Cite this article
Fujishige, S. A note on Faigle and Kern’s dual greedy polyhedra. Math. Program. 88, 217–220 (2000). https://doi.org/10.1007/s101070050013
Issue Date:
DOI: https://doi.org/10.1007/s101070050013