Making sparse matrices sparser: Computational results (Q751503)

From MaRDI portal
Revision as of 11:51, 21 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Making sparse matrices sparser: Computational results
scientific article

    Statements

    title
    Making sparse matrices sparser: Computational results (English)
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    preprocessing
    0 references
    sparse matrices
    0 references
    bipartite matching
    0 references
    Sparsity Problem
    0 references
    computational results
    0 references
    Simplex Algorithm
    0 references
    heuristic algorithm
    0 references

    Identifiers

    DOI
    10.1007/BF01588780
    0 references
    Mathematics Subject Classification ID
    90C06
    0 references
    90C05
    0 references
    90-08
    0 references
    zbMATH DE Number
    4176828
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q751503&oldid=34838684"
    Powered by MediaWiki