| Article ID: | iaor19972104 |
| Country: | Netherlands |
| Volume: | 72 |
| Issue: | 2 |
| Start Page Number: | 195 |
| End Page Number: | 206 |
| Publication Date: | Feb 1996 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Kern Walter, Faigle Ulrich |
A general linear programming model for an order-theoretic analysis of both Edmonds’ greedy algorithm for matroids and the NW-corner rule for transportation problems with Monge costs is introduced. This approach includes the model of Queyranne, Spieksma and Tardella as a special case. The authors solve the problem by optimal greedy algorithms for rooted forests as underlying structures. Other solvable cases are also discussed.