A general class of greedily solvable linear programs

M Queyranne*, F Spieksma, F Tardella

*Corresponding author for this work

    Research output: Contribution to journalArticleAcademicpeer-review

    Original languageEnglish
    Pages (from-to)892-908
    Number of pages17
    JournalMathematics of Operations Research
    Volume23
    Issue number4
    DOIs
    Publication statusPublished - Nov 1998

    Keywords

    • greedy algorithms
    • Monge property
    • multi-index transportation problems
    • lattices
    • submodular functions
    • submodular systems
    • polymatroids
    • APPROXIMATION ALGORITHMS
    • ASSIGNMENT PROBLEMS
    • DECOMPOSABLE COSTS
    • MONGE
    • PROPERTY
    • FLOWS

    Cite this