A Greedy Heuristic for the Set-Covering Problem (Q3887227)

From MaRDI portal
Revision as of 01:04, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Greedy Heuristic for the Set-Covering Problem
scientific article

    Statements

    title
    A Greedy Heuristic for the Set-Covering Problem (English)
    0 references
    DOI
    10.1287/moor.4.3.233
    0 references
    publication date
    1979
    0 references
    zbMATH DE Number
    3693006
    0 references
    zbMATH Keywords
    greedy heuristic
    0 references
    set-covering problem
    0 references
    binary matrix
    0 references
    approximate solution
    0 references
    asymptotic exactness estimation
    0 references
    OpenAlex ID
    W2157054705
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3887227&oldid=32514067"
    Powered by MediaWiki