A graph-based hyper-heuristic for educational timetabling problems (Q2432892)

From MaRDI portal
Revision as of 22:25, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A graph-based hyper-heuristic for educational timetabling problems
scientific article

    Statements

    title
    A graph-based hyper-heuristic for educational timetabling problems (English)
    0 references
    author
    Edmund Kieran Burke
    0 references
    Barry McCollum
    0 references
    Amnon Meisels
    0 references
    Sanja Petrovic
    0 references
    Rong Qu
    0 references
    publication date
    25 October 2006
    0 references
    Mathematics Subject Classification ID
    90B90
    0 references
    90C59
    0 references
    90C90
    0 references
    zbMATH DE Number
    5067649
    0 references
    zbMATH Keywords
    heuristics
    0 references
    graph heuristics
    0 references
    hyper-heuristics
    0 references
    tabu search
    0 references
    timetabling
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2432892&oldid=15087960"
    Powered by MediaWiki