Relation-algebraic specification and solution of special university timetabling problems

DOI10.1016/j.jlap.2010.07.013zbMath1198.90168MaRDI QIDQ604453

Britta Kehden, Rudolf Berghammer

Publication date: 11 November 2010

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2010.07.013

zbMATH Keywords

timetabling; relation algebra; tool support; RelView; formal program development

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

90B35: Deterministic scheduling theory in operations research

Related Items

Computing and visualizing Banks sets of dominance relations using relation algebra and RelView, Relational computation of sets of relations

Uses Software

• RelView

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relation-algebraic computation of fixed points with applications
• Theory and applications of relational structures as knowledge instruments II. International workshops of COST Action 274, TARSKI, 2002--2005. Selected revised papers
• A Boolean matrix iteration in timetable construction
• Theory and applications of relational structures as knowledge instruments. COST Action 274, TARSKI. Revised papers
• Relational Methods in Computer Science
• Handbook of Graph Theory
• Evaluating Sets of Search Points Using Relational Algebra
• Computer Algebra in Scientific Computing