The generalized balanced academic curriculum problem with heterogeneous classes

DOI10.1007/s10479-013-1358-8zbMath1301.90032OpenAlexW2050723929MaRDI QIDQ475183

Sara Ceschia, Andrea Schaerf, Luca Di Gaspero

Publication date: 26 November 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1358-8

zbMATH Keywords

simulated annealingtimetablingmixed integer quadratic programmingacademic planning

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

An ILP based heuristic for a generalization of the post-enrollment course timetabling problem ⋮ Measures of balance in combinatorial optimization

Uses Software

• BACP
• EasyLocal++
• CSPLib

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The balanced academic curriculum problem revisited
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• A branch-and-cut procedure for the Udine course timetabling problem
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition