Pages that link to "Item:Q1761891"
From MaRDI portal
The following pages link to A branch-and-cut procedure for the Udine course timetabling problem (Q1761891):
Displaying 25 items.
- Fairness in academic course timetabling (Q284412) (← links)
- Operational research in education (Q319179) (← links)
- A new lower bound for curriculum-based course timetabling (Q336544) (← links)
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem (Q342574) (← links)
- The generalized balanced academic curriculum problem with heterogeneous classes (Q475183) (← links)
- Timetable construction: the algorithms and complexity perspective (Q475200) (← links)
- Preprocessing and an improved MIP model for examination timetabling (Q492792) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
- Benders decomposition for curriculum-based course timetabling (Q1652557) (← links)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling (Q1991148) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system (Q2079435) (← links)
- An exact algorithm for the edge coloring by total labeling problem (Q2178329) (← links)
- Integer programming ensemble of temporal relations classifiers (Q2218417) (← 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)
- Adaptive tabu search for course timetabling (Q2379550) (← links)
- The maximum-impact coloring polytope (Q2968505) (← links)
- A new adjustment of the branch and price algorithm for university course timetabling (Q5046123) (← links)
- Answer set programming as a modeling language for course timetabling (Q5398311) (← links)
- Facet-generating procedures for the maximum-impact coloring polytope (Q5918552) (← links)
- Facet-generating procedures for the maximum-impact coloring polytope (Q5918669) (← links)