Pages that link to "Item:Q1761917"
From MaRDI portal
The following pages link to Strong bounds with cut and column generation for class-teacher timetabling (Q1761917):
Displaying 22 items.
- GOAL solver: a hybrid local search based solver for high school timetabling (Q284398) (← links)
- Late acceptance hill-climbing for high school timetabling (Q309068) (← links)
- Operational research in education (Q319179) (← links)
- Developing compact course timetables with optimized student flows (Q322740) (← links)
- A two-stage decomposition of high school timetabling applied to cases in Denmark (Q336881) (← links)
- A fix-and-optimize heuristic for the high school timetabling problem (Q337176) (← links)
- Variable neighborhood search based algorithms for high school timetabling (Q337210) (← links)
- An assignment problem and its application in education domain: a review and potential path (Q721078) (← links)
- Generating class schedules within a complex modular environment with application to secondary schools (Q892836) (← links)
- Integer programming for the generalized high school timetabling problem (Q892837) (← links)
- maxSAT-based large neighborhood search for high school timetabling (Q1652069) (← links)
- Parallel local search algorithms for high school timetabling problems (Q1681327) (← links)
- Practices in timetabling in higher education institutions: a systematic review (Q1730752) (← links)
- A column generation approach to high school timetabling modeled as a multicommodity flow problem (Q1752250) (← links)
- Integer programming techniques for educational timetabling (Q1754009) (← links)
- The consultation timetabling problem at Danish high schools (Q2359151) (← links)
- Modeling high school timetabling with bitvectors (Q2398422) (← links)
- High quality timetables for Italian schools (Q2676380) (← links)
- An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department (Q2688892) (← links)
- A SA-VNS approach for the High School Timetabling Problem (Q2840769) (← links)
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153) (← links)
- (Q5046123) (← links)