Recommendations
Cites work
- A Primer in Column Generation
- A tabu search algorithm for computing an operational timetable
- An introduction to timetabling
- Branch-and-price: Column generation for solving huge integer programs
- Decomposition Principle for Linear Programs
- Exploiting orbits in symmetric ILP
- ITC2007 solver description: a hybrid approach
- Multicriteria optimization
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Orbitopal Fixing
- School Timetabling—A Case in Large Binary Integer Linear Programming
Cited in
(5)- Elective course student sectioning at Danish high schools
- AHP and multichoice goal programming integration for course planning
- An adaptive large neighbourhood search metaheuristic for hourly learning activity planning in personalised learning
- The consultation timetabling problem at Danish high schools
- A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning
This page was built for publication: Elective course planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420895)