Elective course planning

DOI10.1016/j.ejor.2011.06.039zbMath1238.90085OpenAlexW2066903126MaRDI QIDQ420895

Simon Kristiansen, Matias Sørensen, Thomas Riis 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

zbMATH Keywords

integer programmingDantzig-Wolfe decompositionelective course planningbranch and priceexplicit constraint branchinghigh school planning

Mathematics Subject Classification ID

Theory of organizations, manpower planning in operations research (90B70)

Related Items (5)

The consultation timetabling problem at Danish high schools ⋮ Elective course student sectioning 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 ⋮ AHP and multichoice goal programming integration for course planning

Cites Work

• An introduction to timetabling
• A tabu search algorithm for computing an operational timetable
• Exploiting orbits in symmetric ILP
• Multicriteria optimization
• ITC2007 solver description: a hybrid approach
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• School Timetabling—A Case in Large Binary Integer Linear Programming
• Decomposition Principle for Linear Programs
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• Orbitopal Fixing
• A Primer in Column Generation

This page was built for publication: Elective course planning