On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid (Q2828332)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid
scientific article

    Statements

    On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    minimum-concave-cost flow
    0 references
    two-dimensional grid
    0 references
    lot sizing
    0 references
    serial supply chain
    0 references
    computational complexity
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references