A new lower bound for curriculum-based course timetabling.
Valentina CacchianiAlberto CapraraRoberto RobertiPaolo TothPublished in: Comput. Oper. Res. (2013)
Keyphrases
- lower bound
- upper bound
- constraint satisfaction
- branch and bound algorithm
- lower and upper bounds
- np hard
- high school
- objective function
- branch and bound
- optimal solution
- lower bounding
- worst case
- computer science curriculum
- upper and lower bounds
- secondary school
- linear programming relaxation
- online algorithms
- professional development
- curriculum development
- vc dimension
- sample complexity
- elementary school
- sufficiently accurate
- software engineering