Pages that link to "Item:Q880517"

The following pages link to A computational study of a cutting plane algorithm for university course timetabling (Q880517):

Displaying 18 items.

• Integer programming techniques for the nurse rostering problem (Q284423) (← links)
• A MILP model for the teacher assignment problem considering teachers' preferences (Q321129) (← links)
• Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
• Computational models for timetabling problem (Q478951) (← links)
• A branch and cut heuristic for a runway scheduling problem (Q510289) (← links)
• A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
• Term-end exam scheduling at United States Military Academy/West Point (Q707689) (← links)
• A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems (Q835631) (← links)
• School timetabling for quality student and teacher schedules (Q842557) (← links)
• Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
• Integer programming techniques for educational timetabling (Q1754009) (← 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)
• Strong bounds with cut and column generation for class-teacher timetabling (Q1761917) (← links)
• Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem (Q2281613) (← links)
• An overview of curriculum-based course timetabling (Q2355018) (← links)
• A column generation mathematical programming approach for a class-faculty assignment problem with preferences (Q2355201) (← links)
• (Q5046123) (← links)