Pages that link to "Item:Q5391956"
From MaRDI portal
The following pages link to Penalising Patterns in Timetables: Novel Integer Programming Formulations (Q5391956):
Displaying 15 items.
- Computational models for timetabling problem (Q478951) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Quality recovering of university timetables (Q666944) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- Benders decomposition for curriculum-based course timetabling (Q1652557) (← 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)
- 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)
- 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)
- 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)
- Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)
