Algorithm selection and instance space analysis for curriculum-based course timetabling
Authors:
- Arnaud De CosterACArnaud De Coster
- Nysret MusliuNMNysret Musliu
- Andrea SchaerfASAndrea Schaerf
- Johannes SchoisswohlJSJohannes Schoisswohl
- Kate Smith-MilesKSKate Smith-Miles
- 10 September 2021
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 25 (1) , 35-58
Abstract
No abstract availableKeywords
Funding Information
- Christian Doppler Forschungsgesellschaft (Christian Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling)
- Österreichische Agentur für Internationale Mobilität und Kooperation in Bildung, Wissenschaft und Forschung (K-05-2017)
- Australian Research Council (FL140100012)
This publication has 27 references indexed in Scilit:
- Algorithm Selection for the Graph Coloring Problem2013
- Generating Applicable Synthetic Instances for Branch ProblemsOperations Research, 2013
- Conflict-driven answer set solving: From theory to practiceArtificial Intelligence, 2012
- Measuring instance difficulty for combinatorial optimization problemsComputers & Operations Research, 2012
- Curriculum-based course timetabling with SAT and MaxSATAnnals of Operations Research, 2012
- Discovering the suitability of optimisation algorithms by learning from evolved instancesAnnals of Mathematics and Artificial Intelligence, 2011
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and resultsAnnals of Operations Research, 2010
- ITC2007 solver description: a hybrid approachAnnals of Operations Research, 2009
- Cross-disciplinary perspectives on meta-learning for algorithm selectionACM Computing Surveys, 2009
- The Algorithm Selection Problem1976