Pages that link to "Item:Q1761890"
From MaRDI portal
The following pages link to Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results (Q1761890):
Displaying 31 items.
- Real-life curriculum-based timetabling with elective courses and course sections (Q284409) (← links)
- A decision support approach to automatic timetabling in higher education institutions (Q310350) (← links)
- Developing compact course timetables with optimized student flows (Q322740) (← links)
- A new lower bound for curriculum-based course timetabling (Q336544) (← links)
- Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
- XHSTT: an XML archive for high school timetabling problems in different countries (Q475206) (← links)
- Quality recovering of university timetables (Q666944) (← links)
- Benders decomposition for curriculum-based course timetabling (Q1652557) (← links)
- An integer programming approach to curriculum-based examination timetabling (Q1686500) (← links)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
- Towards a reference model for timetabling and rostering (Q1761899) (← links)
- Curriculum based course timetabling: new solutions to Udine benchmark instances (Q1761906) (← links)
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling (Q1991148) (← links)
- A new model for curriculum-based university course timetabling (Q2037886) (← links)
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study (Q2225651) (← links)
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem (Q2281613) (← links)
- Flow formulations for curriculum-based course timetabling (Q2288875) (← links)
- An overview of curriculum-based course timetabling (Q2355018) (← links)
- Adaptive tabu search for course timetabling (Q2379550) (← links)
- Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424) (← links)
- Integer programming for minimal perturbation problems in university course timetabling (Q2398425) (← links)
- Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions (Q2668751) (← links)
- Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm (Q3534665) (← links)
- Boosting Answer Set Optimization with Weighted Comparator Networks (Q4957202) (← links)
- Rewriting optimization statements in answer-set programs (Q5240209) (← links)
- Answer set programming as a modeling language for course timetabling (Q5398311) (← links)
- Comments on: ``An overview of curriculum-based course timetabling'' (Q5971109) (← links)
- Exact and metaheuristic methods for a real-world examination timetabling problem (Q6136080) (← links)
- Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)
