Publication Details
Using Integer Programming for Discrete Problem Optimization
Cutaraj Valerie (UMALTA)
Češka Milan, prof. RNDr., CSc. (DITS FIT BUT)
integer programming, optimization, timetable generation, Petri nets
An application of integer programming that generates optimal examination timetables is presented. The model is based on common assignment problem constraints together with more advanced logical constraints penalty-based relaxations. In order to minimize the number of constraints we identify dense timetables where the main objective is elimination of clashes and sparse timetables where we spread the exams as evenly as possible.
We present an application of integer programming that generates optimal examination timetables. The model is based on common assignment problem constraints together with more advanced logical constraints penalty-based relaxations. In order to minimize the number of constraints we identify dense timetables where the main objective is elimination of clashes and sparse timetables where we spread the exams as evenly as possible. We also discuss the possibility of using Petri and related nets to solve this problem.
@INPROCEEDINGS{FITPUB8823, author = "Jaroslav Sklen\'{a}\v{r} and Valerie Cutaraj and Milan \v{C}e\v{s}ka", title = "Using Integer Programming for Discrete Problem Optimization", pages = "19--21", booktitle = "The 2008 European Simulation and Modelling Conference", series = "EUROSIS-ETI Publications", year = 2008, location = "LE HAVRE, FR", publisher = "EUROSIM-FRANCOSIM-ARGESIM", ISBN = "978-90-77381-44-1", language = "english", url = "https://www.fit.vut.cz/research/publication/8823" }