Selected Papers

• Al-Betar MA, Khader AT.  2012.  A harmony search algorithm for university course timetabling. Annals of Operations Research. 194:3-31.

  • Google Scholar
  • BibTeX
• Bilgin B, De Causmaecker P, Rossie B, Vanden Berghe G.  2012.  Local search neighbourhoods for dealing with a novel nurse rostering model. Annals of Operations Research. 194:33-57.

  • Google Scholar
  • BibTeX
• Burke EK., Mareček J, Parkes AJ., Rudová H.  2012.  A branch-and-cut procedure for the Udine Course Timetabling problem. Annals of Operations Research. 194:71-87.

  • Google Scholar
  • BibTeX
• Burke EK., Pham N, Qu R, Yellen J.  2012.  Linear combinations of heuristics for examination timetabling. Annals of Operations Research. 194:89-109.

  • Google Scholar
  • BibTeX
• Cambazard H, Hebrard E, O’Sullivan B, Papadopoulos A.  2012.  Local search and constraint programming for the post enrolment-based course timetabling problem. Annals of Operations Research. 194:111-135.

  • Google Scholar
  • BibTeX
• Costa FN., Urrutia S, Ribeiro CC..  2012.  An ILS heuristic for the traveling tournament problem with predefined venues. Annals of Operations Research. 194:137-150.

  • Google Scholar
  • BibTeX
• Crainic TG, Errico F, Malucelli F, Nonato M.  2012.  Designing the master schedule for demand-adaptive transit systems. Annals of Operations Research. 194:151-166.

  • Google Scholar
  • BibTeX
• De Causmaecker P, Berghe GVanden.  2012.  Towards a reference model for timetabling and rostering. Annals of Operations Research. 194:167-176.

  • Google Scholar
  • BibTeX
• Dorndorf U, Jaehn F, Pesch E.  2012.  Flight gate scheduling with respect to a reference schedule. Annals of Operations Research. 194:177-187.

  • Google Scholar
  • BibTeX
• Geiger MJ.  2012.  Applying the threshold accepting metaheuristic to curriculum based course timetabling. Annals of Operations Research. 194:189-202.

  • Google Scholar
  • BibTeX
• Gogos C, Alefragis P, Housos E.  2012.  An improved multi-staged algorithmic process for the solution of the examination timetabling problem. Annals of Operations Research. 194:203-221.

  • Google Scholar
  • BibTeX
• Goossens, sR. D, Beliën J, Spieksma FC.R..  2012.  Comparing league formats with respect to match importance in Belgian football. Annals of Operations Research. 194:223-240.

  • Google Scholar
  • BibTeX
• Kingston JH..  2012.  Resource assignment in high school timetabling. Annals of Operations Research. 194:241-254.

  • Google Scholar
  • BibTeX
• Lach G, Lübbecke ME..  2012.  Curriculum based course timetabling: new solutions to Udine benchmark instances. Annals of Operations Research. 194:255-272.

  • Google Scholar
  • BibTeX
• Lewis R.  2012.  A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. Annals of Operations Research. 194:273-289.

  • Google Scholar
  • BibTeX
• McCollum B, McMullan P, Parkes AJ., Burke EK., Qu R.  2012.  A new model for automated examination timetabling. Annals of Operations Research. 194:291-315.

  • Google Scholar
  • BibTeX
• Nothegger C, Mayer A, Chwatal A, Raidl GR..  2012.  Solving the post enrolment course timetabling problem by ant colony optimization. Annals of Operations Research. 194:325-339.

  • Google Scholar
  • BibTeX
• Pais TC, Amaral P.  2012.  Managing the tabu list length using a fuzzy inference system: an application to examination timetabling. Annals of Operations Research. 194:341-363.

  • Google Scholar
  • BibTeX
• Petrovic S, Vanden Berghe G.  2012.  A comparison of two approaches to nurse rostering problems. Annals of Operations Research. 194:365-384.

  • Google Scholar
  • BibTeX
• Post G, Ahmadi S, Daskalaki S, Kingston JH., Kyngas J, Nurmi C, Ranson D.  2012.  An XML format for benchmarks in High School Timetabling. Annals of Operations Research. 194:385-397.

  • Google Scholar
  • BibTeX
• Santos HG, Uchoa E, Ochi LS, Maculan N.  2012.  Strong bounds with cut and column generation for class-teacher timetabling. Annals of Operations Research. 194:399-412.

  • Google Scholar
  • BibTeX
• Triska M, Musliu N.  2012.  An effective greedy heuristic for the Social Golfer Problem. Annals of Operations Research. 194:413-425.

  • Google Scholar
  • BibTeX
• Triska M, Musliu N.  2012.  An improved SAT formulation for the social golfer problem. Annals of Operations Research. 194:427-438.

  • Google Scholar
  • BibTeX
• van den Broek J.J.J., Hurkens C.A.J..  2012.  An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007. Annals of Operations Research. 194:439-454.

  • Google Scholar
  • BibTeX