Elective course planning
From MaRDI portal
Publication:420895
DOI10.1016/J.EJOR.2011.06.039zbMATH Open1238.90085OpenAlexW2066903126MaRDI QIDQ420895FDOQ420895
Authors: Simon Kristiansen, Matias Sørensen, Thomas R. Stidsen 
Publication date: 23 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.039
Recommendations
integer programmingelective course planningDantzig-Wolfe decompositionbranch and priceexplicit constraint branchinghigh school planning
Cites Work
- Multicriteria optimization
- Branch-and-price: Column generation for solving huge integer programs
- A Primer in Column Generation
- ITC2007 solver description: a hybrid approach
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Decomposition Principle for Linear Programs
- A tabu search algorithm for computing an operational timetable
- An introduction to timetabling
- School Timetabling—A Case in Large Binary Integer Linear Programming
- Exploiting orbits in symmetric ILP
- Orbitopal Fixing
Cited In (5)
- Elective course student sectioning at Danish high schools
- AHP and multichoice goal programming integration for course planning
- The consultation timetabling problem at Danish high schools
- A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning
- An adaptive large neighbourhood search metaheuristic for hourly learning activity planning in personalised 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)
