Maintenance scheduling problems as benchmarks for constraint algorithms (Q1978021)

From MaRDI portal
Revision as of 10: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
Maintenance scheduling problems as benchmarks for constraint algorithms
scientific article

    Statements

    title
    Maintenance scheduling problems as benchmarks for constraint algorithms (English)
    0 references
    author
    Daniel Frost
    0 references
    Rina Dechter
    0 references
    publication date
    7 June 2000
    0 references
    zbMATH Keywords
    search algorithm
    0 references
    scheduling
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68P10
    0 references
    68T05
    0 references
    68M20
    0 references
    zbMATH DE Number
    1456920
    0 references
    OpenAlex ID
    W1707765878
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1978021&oldid=37219691"
    Powered by MediaWiki