Relation Algebra and RelView in Practical Use: Construction of Special University Timetables
DOI10.1007/978-3-540-78913-0_4zbMATH Open1138.90392OpenAlexW1501899593MaRDI QIDQ3498403FDOQ3498403
Authors: Rudolf Berghammer, Britta Kehden
Publication date: 15 May 2008
Published in: Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78913-0_4
Recommendations
- Relation-algebraic specification and solution of special university timetabling problems
- Relation algebras and their application in temporal and spatial reasoning
- Relational construction of specific timetables
- Applying relation algebra and RelView to solve problems on orders and lattices
- scientific article; zbMATH DE number 993586
- scientific article; zbMATH DE number 1223544
- University timetabling by constraint-based reasoning: A case study
- A perspective on the theory of relation algebras
- Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView
- Algebraic Visualization of Relations Using RelView
Symbolic computation and algebraic computation (68W30) Deterministic scheduling theory in operations research (90B35) Cylindric and polyadic algebras; relation algebras (03G15)
Cites Work
Cited In (4)
Uses Software
This page was built for publication: Relation Algebra and RelView in Practical Use: Construction of Special University Timetables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498403)