par Kostuch, Philipp 
;Socha, Krzysztof
Référence Lecture notes in computer science, 3004, page (135-144)
Publication Publié, 2004
;Socha, Krzysztof Référence Lecture notes in computer science, 3004, page (135-144)
Publication Publié, 2004
Article révisé par les pairs
| Résumé : | This paper presents an attempt to find a statistical model that predicts the hardness of the University Course Timetabling Problem by analyzing instance properties. The model may later be used for better understanding what makes a particular instance hard. It may also be used for tuning the algorithm actually solving that problem instance. The paper introduces the definition of hardness, explains the statistical approach used for modeling instance hardness, as well as presents results obtained and possible ways of exploiting them. © Springer-Verlag 2004. |
