Multiple-retrieval case-based reasoning for course timetabling problems

@misc{citeulike:1734900, abstract = {This paper presents amultiple-retriev6 approach that partitions a large problem into smallsolvS40 sub-problems byrecursiv5/ inputting theunsolv/ part of the graph into the decision tree for retrievSW The adaptation combines theretriev4 partial solutions of all the partitioned sub-problems and employs a graph heuristic method to construct the whole solution for the new case. We present a methodology which is not dependent upon problem-specific information and which, as such,...}, author = {Burke, E. and Maccarthy, B. and Petrovic, S. and Qu, R. }, citeulike-article-id = {1734900}, keywords = {problems, timetabling}, posted-at = {2007-10-07 03:34:38}, priority = {2}, title = {Multiple-retrieval case-based reasoning for course timetabling problems}, url = {http://citeseer.ist.psu.edu/burke05multipleretrieval.html}, year = {2001} }

TY - GEN ID - citeulike:1734900 L3 - citeulike-article-id:1734900 N2 - This paper presents amultiple-retriev6 approach that partitions a large problem into smallsolvS40 sub-problems byrecursiv5/ inputting theunsolv/ part of the graph into the decision tree for retrievSW The adaptation combines theretriev4 partial solutions of all the partitioned sub-problems and employs a graph heuristic method to construct the whole solution for the new case. We present a methodology which is not dependent upon problem-specific information and which, as such,... TI - Multiple-retrieval case-based reasoning for course timetabling problems KW - problems KW - timetabling AU - Burke, E AU - Maccarthy, B AU - Petrovic, S AU - Qu, R PY - 2001/// UR - http://citeseer.ist.psu.edu/burke05multipleretrieval.html ER -