Home > Research > Publications & Outputs > Integer programming methods for large-scale pra...

Electronic data

  • roomAssignmentv13

    Rights statement: This is the author’s review version of a work that was accepted for publication in Computers and Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers and Operations Research, 53, 2015 DOI: 10.1016/j.cor.2014.07.012

    Submitted manuscript, 336 KB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

View graph of relations

Integer programming methods for large-scale practical classroom assignment problems

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
Close
<mark>Journal publication date</mark>01/2015
<mark>Journal</mark>Computers and Operations Research
Volume53
Number of pages12
Pages (from-to)42-53
Publication StatusPublished
<mark>Original language</mark>English

Abstract

In this paper we present an integer programming method for solving the Classroom Assignment Problem in University Course Timetabling. We introduce a novel formulation of the problem which generalises existing models and maintains tractability even for large instances. The model is validated through computational results based on our experiences at the University of Auckland, and on instances from the 2007 International Timetabling Competition. We also expand upon existing results into the computational difficulty of room assignment problems.

Bibliographic note

This is the author’s review version of a work that was accepted for publication in Computers and Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers and Operations Research, 53, 2015 DOI: 10.1016/j.cor.2014.07.012