A simplex algorithm for minimum-cost network-flow problems in infinite networks (Q3632966)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A simplex algorithm for minimum-cost network-flow problems in infinite networks
scientific article

    Statements

    A simplex algorithm for minimum-cost network-flow problems in infinite networks (English)
    0 references
    0 references
    0 references
    0 references
    16 June 2009
    0 references
    infinite-dimensional optimization
    0 references
    duality
    0 references
    network simplex algorithm
    0 references
    value convergence
    0 references
    solution convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers