An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007

DOI10.1007/s10479-010-0708-zzbMath1251.90132OpenAlexW2120643397MaRDI QIDQ1761922

J. J. J. Van Den Broek, Cor A. J. Hurkens

Publication date: 15 November 2012

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

Full work available at URL: https://doi.org/10.1007/s10479-010-0708-z

zbMATH Keywords

integer programmingcolumn generationcourse timetablingITC2007

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem ⋮ An ILP based heuristic for a generalization of the post-enrollment course timetabling problem ⋮ A matheuristic for customized multi-level multi-criteria university timetabling ⋮ Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure

Cites Work

• Unnamed Item
• Unnamed Item
• Solving the post enrolment course timetabling problem by ant colony optimization
• ITC2007 solver description: a hybrid approach
• Selected Topics in Column Generation
• A Primer in Column Generation
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007