An algorithm for set covering problem (Q1823139)

From MaRDI portal
Revision as of 09:08, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An algorithm for set covering problem
scientific article

    Statements

    title
    An algorithm for set covering problem (English)
    0 references
    publication date
    1987
    0 references
    zbMATH Keywords
    set covering
    0 references
    problem reduction tests
    0 references
    dual ascent
    0 references
    subgradient optimization
    0 references
    author
    John E. Beasley
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C09
    0 references
    05C70
    0 references
    65K05
    0 references
    90C05
    0 references
    zbMATH DE Number
    4114372
    0 references
    OpenAlex ID
    W1977723771
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1823139&oldid=37013659"
    Powered by MediaWiki