The Set-Covering Problem: A New Implicit Enumeration Algorithm (Q4162967)

From MaRDI portal
Revision as of 01:03, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3596581
Language Label Description Also known as
English
The Set-Covering Problem: A New Implicit Enumeration Algorithm
scientific article; zbMATH DE number 3596581

    Statements

    The Set-Covering Problem: A New Implicit Enumeration Algorithm (English)
    0 references
    0 references
    1977
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references