Programmed Search in a Timetabling Problem over Finite Domains (Q2873803)

From MaRDI portal
Revision as of 07:23, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Programmed Search in a Timetabling Problem over Finite Domains
scientific article

    Statements

    title
    Programmed Search in a Timetabling Problem over Finite Domains (English)
    0 references
    publication date
    24 January 2014
    0 references
    Mathematics Subject Classification ID
    68T20
    0 references
    68N17
    0 references
    68N18
    0 references
    zbMATH DE Number
    6250554
    0 references
    zbMATH Keywords
    finite domains
    0 references
    search
    0 references
    applications
    0 references
    timetabling
    0 references
    describes a project that uses
    Curry
    0 references
    GAMS
    0 references
    Genocop
    0 references
    OpenAlex ID
    W2034401919
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2873803&oldid=35370004"
    Powered by MediaWiki