Decomposition, reformulation, and diving in university course timetabling
- 31 March 2010
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 37 (3), 582-597
- https://doi.org/10.1016/j.cor.2009.02.023
Abstract
No abstract availableKeywords
Other Versions
This publication has 44 references indexed in Scilit:
- Towards improving the utilization of university teaching spaceJournal of the Operational Research Society, 2009
- An improved algorithm for solving biobjective integer programsAnnals of Operations Research, 2006
- Equitable colorings of bounded treewidth graphsTheoretical Computer Science, 2005
- Decomposition and Dynamic Cut Generation in Integer Linear ProgrammingMathematical Programming, 2005
- The feasibility pumpMathematical Programming, 2005
- Exploring relaxation induced neighborhoods to improve MIP solutionsMathematical Programming, 2004
- Metaheuristics in combinatorial optimizationACM Computing Surveys, 2003
- Local branchingMathematical Programming, 2003
- A multistage evolutionary algorithm for the timetable problemIEEE Transactions on Evolutionary Computation, 1999
- Automated University Timetabling: The State of the ArtThe Computer Journal, 1997