Pages that link to "Item:Q2398425"
From MaRDI portal
The following pages link to Integer programming for minimal perturbation problems in university course timetabling (Q2398425):
Displaying 10 items.
- Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
- Hybrid search for minimal perturbation in dynamic CSPs (Q647481) (← links)
- Quality recovering of university timetables (Q666944) (← links)
- Application of a real-world university-course timetabling model solved by integer programming (Q1018245) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Robust university course timetabling problem subject to single and multiple disruptions (Q2286982) (← links)
- A computational approach to enhancing course timetabling with integer programming (Q2369205) (← 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)
- An integer programming model for assigning students to elective courses (Q2966476) (← links)