Pages that link to "Item:Q3990560"

The following pages link to When Is the Classroom Assignment Problem Hard? (Q3990560):

Displaying 10 items.

• A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342) (← links)
• Operational research in education (Q319179) (← links)
• Increasing the revenue of self-storage warehouses by optimizing order scheduling (Q322833) (← links)
• Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
• A survey of school timetabling research (Q475201) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• Resource assignment in high school timetabling (Q1761904) (← links)
• Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
• A multi-stage IP-based heuristic for class timetabling and trainer rostering (Q2398428) (← links)
• Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)