Pages that link to "Item:Q3821921"
From MaRDI portal
The following pages link to A Lagrangian Relaxation Approach To The Classroom Assignment Problem<sup>*</sup> (Q3821921):
Displaying 13 items.
- Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
- Case-based heuristic selection for timetabling problems (Q880536) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- A logic approach to the resolution of constraints in timetabling (Q1194718) (← links)
- Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
- Linear combinations of heuristics for examination timetabling (Q1761893) (← links)
- A graph-based hyper-heuristic for educational timetabling problems (Q2432892) (← links)
- Mathematical programming models and algorithms for a class--faculty assignment problem (Q2496072) (← links)
- Lagrangian heuristics for instructor scheduling in executive development programmes (Q4363740) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)