About: Strengthened Integer Programming Formulation of Constraints Counting Matches of Patterns in Timetables     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Complex real-world problems in timetabling, especially university course timetabling and employee rostering, have an underpinning graph colouring component, a pattern matching component and a number of side constraints. Problems with pattern matching constraints such as ``students should not have more than three lectures in a row and five lectures in a day'' tend to be over-constrained, making it necessary for integer programming formulations to implement pattern matching using either goal programming or to implement soft constraints, which count the number of occurrences of undesirable patterns. This paper introduces an integer programming formulation, where the number of such occurrences is counted both locally and by enumeration of patterns over daily timetables. With a number of strong valid constraints taking advantage of the interplay of the two methods of counting, this formulation seems to outperform any of its constituent parts.
  • Complex real-world problems in timetabling, especially university course timetabling and employee rostering, have an underpinning graph colouring component, a pattern matching component and a number of side constraints. Problems with pattern matching constraints such as ``students should not have more than three lectures in a row and five lectures in a day'' tend to be over-constrained, making it necessary for integer programming formulations to implement pattern matching using either goal programming or to implement soft constraints, which count the number of occurrences of undesirable patterns. This paper introduces an integer programming formulation, where the number of such occurrences is counted both locally and by enumeration of patterns over daily timetables. With a number of strong valid constraints taking advantage of the interplay of the two methods of counting, this formulation seems to outperform any of its constituent parts. (en)
Title
  • Strengthened Integer Programming Formulation of Constraints Counting Matches of Patterns in Timetables
  • Strengthened Integer Programming Formulation of Constraints Counting Matches of Patterns in Timetables (en)
skos:prefLabel
  • Strengthened Integer Programming Formulation of Constraints Counting Matches of Patterns in Timetables
  • Strengthened Integer Programming Formulation of Constraints Counting Matches of Patterns in Timetables (en)
skos:notation
  • RIV/00216224:14330/07:00041526!RIV11-MSM-14330___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 452722
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/07:00041526
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • integer programming; course timetabling; patterns (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [018C8E03DD86]
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Rudová, Hana
  • Mareček, Jakub
  • Burke, Edmund K.
http://linked.open...n/vavai/riv/zamer
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 117 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software