Pages that link to "Item:Q2267318"
From MaRDI portal
The following pages link to ITC2007 solver description: a hybrid approach (Q2267318):
Displayed 33 items.
- GOAL solver: a hybrid local search based solver for high school timetabling (Q284398) (← links)
- Fairness in academic course timetabling (Q284412) (← links)
- Late acceptance hill-climbing for high school timetabling (Q309068) (← links)
- A step counting hill climbing algorithm applied to university examination timetabling (Q309075) (← links)
- Real-life examination timetabling (Q310336) (← links)
- Variable neighborhood search based algorithms for high school timetabling (Q337210) (← links)
- Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
- Hybrid bee colony optimization for examination timetabling problems (Q337354) (← links)
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
- An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling (Q398923) (← links)
- Elective course planning (Q420895) (← links)
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- Preprocessing and an improved MIP model for examination timetabling (Q492792) (← links)
- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem (Q1652501) (← links)
- Random partial neighborhood search for the post-enrollment course timetabling problem (Q1652508) (← links)
- A cellular memetic algorithm for the examination timetabling problem (Q1652614) (← links)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
- Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems (Q1734832) (← links)
- Integer programming techniques for educational timetabling (Q1754009) (← links)
- Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
- Curriculum based course timetabling: new solutions to Udine benchmark instances (Q1761906) (← links)
- A new model for automated examination timetabling (Q1761908) (← links)
- An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007 (Q1761922) (← links)
- On the performance of scatter search for post-enrolment course timetabling problems (Q2015784) (← links)
- Adaptive linear combination of heuristic orderings in constructing examination timetables (Q2255942) (← links)
- An overview of curriculum-based course timetabling (Q2355018) (← links)
- Feature-based tuning of single-stage simulated annealing for examination timetabling (Q2398423) (← links)
- Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424) (← links)
- A SA-VNS approach for the High School Timetabling Problem (Q2840769) (← links)
- Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm (Q3534665) (← links)
- Simulated annealing with penalization for university course timetabling (Q6090224) (← links)
- Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)