Solving the undirected minimum cost flow problem with arbitrary costs (Q4651934)

From MaRDI portal
Revision as of 03:52, 2 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 2137956
Language Label Description Also known as
English
Solving the undirected minimum cost flow problem with arbitrary costs
scientific article; zbMATH DE number 2137956

    Statements

    Solving the undirected minimum cost flow problem with arbitrary costs (English)
    0 references
    0 references
    23 February 2005
    0 references
    network flows
    0 references
    undirected minimum cost flow problem
    0 references

    Identifiers