A least-squares minimum-cost network flow algorithm (Q646641)

From MaRDI portal
Revision as of 16:22, 3 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A least-squares minimum-cost network flow algorithm
scientific article

    Statements

    title
    A least-squares minimum-cost network flow algorithm (English)
    0 references
    author
    Balaji Gopalakrishnan
    0 references
    Seunghyun Kong
    0 references
    Q646640
    0 references
    Ellis L. Johnson
    0 references
    Joel S. Sokol
    0 references
    publication date
    17 November 2011
    0 references
    zbMATH DE Number
    5973823
    0 references
    zbMATH Keywords
    network flow
    0 references
    least-squares
    0 references
    primal-dual
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q646641&oldid=919631"
      Powered by MediaWiki