Pages that link to "Item:Q2899043"
From MaRDI portal
The following pages link to Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition (Q2899043):
Displayed 50 items.
- A review of hyper-heuristics for educational timetabling (Q284387) (← links)
- The third international timetabling competition (Q284392) (← links)
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling (Q284406) (← links)
- Fairness in academic course timetabling (Q284412) (← links)
- Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem (Q300032) (← links)
- A step counting hill climbing algorithm applied to university examination timetabling (Q309075) (← links)
- The multi-mode resource-constrained multi-project scheduling problem, The MISTA 2013 challenge (Q310341) (← links)
- A new lower bound for curriculum-based course timetabling (Q336544) (← links)
- Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
- Hybrid bee colony optimization for examination timetabling problems (Q337354) (← links)
- Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem (Q342574) (← links)
- An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling (Q398923) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- Memetic techniques for examination timetabling (Q475166) (← links)
- Adaptive selection of heuristics for improving exam timetables (Q475182) (← links)
- The generalized balanced academic curriculum problem with heterogeneous classes (Q475183) (← links)
- The first international nurse rostering competition 2010 (Q475197) (← links)
- A survey of school timetabling research (Q475201) (← links)
- XHSTT: an XML archive for high school timetabling problems in different countries (Q475206) (← links)
- Preprocessing and an improved MIP model for examination timetabling (Q492792) (← links)
- Local search and lower bounds for the patient admission scheduling problem (Q632698) (← links)
- An assignment problem and its application in education domain: a review and potential path (Q721078) (← links)
- A survey of search methodologies and automated system development for examination timetabling (Q835639) (← links)
- Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
- The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution (Q992647) (← links)
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
- Finding happiness: an analysis of the maximum happy vertices problem (Q1634084) (← links)
- Benders decomposition for curriculum-based course timetabling (Q1652557) (← links)
- A cellular memetic algorithm for the examination timetabling problem (Q1652614) (← links)
- An integer programming approach to curriculum-based examination timetabling (Q1686500) (← links)
- The late acceptance hill-climbing heuristic (Q1698884) (← links)
- The second international nurse rostering competition (Q1730710) (← links)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
- Practices in timetabling in higher education institutions: a systematic review (Q1730752) (← links)
- Automated generation of constructive ordering heuristics for educational timetabling (Q1730754) (← links)
- Solving the examination timetabling problem in GPUs (Q1736620) (← links)
- Patient scheduling in hemodialysis service (Q1740427) (← links)
- Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)
- A harmony search algorithm for university course timetabling (Q1761885) (← links)
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results (Q1761890) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling (Q1761901) (← links)
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem (Q1761902) (← links)
- Curriculum based course timetabling: new solutions to Udine benchmark instances (Q1761906) (← links)
- A time-dependent metaheuristic algorithm for post enrolment-based course timetabling (Q1761907) (← links)
- A new model for automated examination timetabling (Q1761908) (← links)
- Solving the post enrolment course timetabling problem by ant colony optimization (Q1761913) (← links)