Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics (Q3487135)

From MaRDI portal
Revision as of 01:05, 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
Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
scientific article

    Statements

    title
    Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics (English)
    0 references
    DOI
    10.1287/mnsc.36.6.674
    0 references
    author
    Marshall L. Fisher
    0 references
    Pradeep Kedia
    0 references
    publication date
    1990
    0 references
    Mathematics Subject Classification ID
    90C10
    0 references
    65K05
    0 references
    90-08
    0 references
    90C09
    0 references
    05C70
    0 references
    zbMATH DE Number
    4160466
    0 references
    zbMATH Keywords
    set covering
    0 references
    set partitioning
    0 references
    continuous heuristics
    0 references
    lower bounds
    0 references
    branch and bound
    0 references
    OpenAlex ID
    W2096090773
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3487135&oldid=32517954"
    Powered by MediaWiki