The University Course Timetabling Problem

Moritz Mühlenthaler
Additional contact information
Moritz Mühlenthaler: University of Erlangen-Nuremberg

Chapter Chapter 2 in Fairness in Academic Course Timetabling, 2015, pp 11-73 from Springer

Abstract: Abstract Despite its simplicity, the UCTP is a computationally tough problem. We will review solution approaches to the UCTP and related problems and investigate combinatorial properties of the UCTP search space. We focus on establishing conditions that guarantee the connectedness of all clash-free timetables with respect to the Kempe-exchange operation.

Keywords: Conjunctive Normal Form; Chordal Graph; Timetabling Problem; Conflict Graph; Availability Requirement (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-319-12799-6_2

Ordering information: This item can be ordered from
http://www.springer.com/9783319127996

DOI: 10.1007/978-3-319-12799-6_2

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().