A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Submodular linear programs on forests
1996
Mathematical programming
Preserved Fulltext
A general linear programming model for an order-theoretic analysis of both Edmonds' ~eedy algorithm for matroids and the NW-comer rule for transportation problems with Monge costs is introduced. This approach includes the model of Queyranne, Spieksma and Tardella (1993) as a special case. We solve the problem by optimal greedy algorithms for rooted forests as underlying structures. Other solvable cases are also discussed.
doi:10.1007/bf02592089
fatcat:ltvmvzwkgfhqdjo5apsyaqhsve