A network simplex method for the budget-constrained minimum cost flow problem (Q1751898)

From MaRDI portal
Revision as of 08:03, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A network simplex method for the budget-constrained minimum cost flow problem
scientific article

    Statements

    A network simplex method for the budget-constrained minimum cost flow problem (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    algorithms
    0 references
    network flow
    0 references
    minimum cost flow
    0 references
    network simplex
    0 references