Publication detail

Using Integer Programming for Discrete Problem Optimization.

SKLENÁŘ, J. CUTARAJ, V. ČEŠKA, M.

Original Title

Using Integer Programming for Discrete Problem Optimization.

English Title

Using Integer Programming for Discrete Problem Optimization.

Type

conference paper

Language

en

Original Abstract

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.

English abstract

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.

Keywords

integer programming, optimization, timetable generation, Petri nets

RIV year

2008

Released

04.12.2008

Publisher

EUROSIM-FRANCOSIM-ARGESIM

Location

LE HAVRE

ISBN

978-90-77381-44-1

Book

The 2008 European Simulation and Modelling Conference

Edition

EUROSIS-ETI Publications

Edition number

NEUVEDEN

Pages from

19

Pages to

21

Pages count

3

Documents

BibTex 


@inproceedings{BUT32324,
  author="Jaroslav {Sklenář} and Valerie {Cutaraj} and Milan {Češka}",
  title="Using Integer Programming for Discrete Problem Optimization.",
  annote="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.",
  address="EUROSIM-FRANCOSIM-ARGESIM",
  booktitle="The 2008 European Simulation and Modelling Conference",
  chapter="32324",
  edition="EUROSIS-ETI Publications",
  howpublished="print",
  institution="EUROSIM-FRANCOSIM-ARGESIM",
  year="2008",
  month="december",
  pages="19--21",
  publisher="EUROSIM-FRANCOSIM-ARGESIM",
  type="conference paper"
}