|
Volumn , Issue , 2003, Pages 492-496
|
Combining the Min-Conflicts and Look-Forward Heuristics to Effectively Solve A Set of Hard University Timetabling Problems
|
Author keywords
Local Search Methods; Scheduling; University Timetabling
|
Indexed keywords
ALGORITHMS;
CONSTRAINT THEORY;
HEURISTIC METHODS;
MATHEMATICAL OPERATORS;
PROBLEM SOLVING;
SEARCH ENGINES;
SET THEORY;
TREES (MATHEMATICS);
CONSTRAINT OPTIMIZATION PROBLEMS (COP);
UNIVERSITY TIMETABLING PROBLEMS (UTP);
COMPUTATIONAL COMPLEXITY;
|
EID: 0345529094
PISSN: 10636730
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (9)
|
References (8)
|