Pages that link to "Item:Q1038298"

The following pages link to Decomposition, reformulation, and diving in university course timetabling (Q1038298):

Displaying 24 items.

• Developing compact course timetables with optimized student flows (Q322740) (← links)
• A new lower bound for curriculum-based course timetabling (Q336544) (← 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)
• 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)
• Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
• Benders decomposition for curriculum-based course timetabling (Q1652557) (← links)
• An integer programming approach to curriculum-based examination timetabling (Q1686500) (← links)
• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
• A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
• Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling (Q1991148) (← links)
• A new model for curriculum-based university course timetabling (Q2037886) (← links)
• Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system (Q2079435) (← links)
• The multiphase course timetabling problem (Q2116932) (← links)
• Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem (Q2281613) (← links)
• Flow formulations for curriculum-based course timetabling (Q2288875) (← 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)
• Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424) (← links)
• Answer set programming as a modeling language for course timetabling (Q5398311) (← links)
• A multi-objective mixed integer linear programming model for thesis defence scheduling (Q6069217) (← links)
• Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)
• A matheuristic for customized multi-level multi-criteria university timetabling (Q6179219) (← links)