Relation-algebraic specification and solution of special university timetabling problems
DOI10.1016/J.JLAP.2010.07.013zbMATH Open1198.90168OpenAlexW2089309178MaRDI QIDQ604453FDOQ604453
Authors: Rudolf Berghammer, Britta Kehden 
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
Recommendations
Symbolic computation and algebraic computation (68W30) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Computer Algebra in Scientific Computing
- Relational Methods in Computer Science
- Handbook of Graph Theory
- Relation-algebraic computation of fixed points with applications
- A Boolean matrix iteration in timetable construction
- Theory and applications of relational structures as knowledge instruments. COST Action 274, TARSKI. Revised papers
- Title not available (Why is that?)
- Theory and applications of relational structures as knowledge instruments II. International workshops of COST Action 274, TARSKI, 2002--2005. Selected revised papers
- Orders, lattices and relations with applications
- Title not available (Why is that?)
- Evaluating Sets of Search Points Using Relational Algebra
Cited In (5)
- Relation Algebra and RelView in Practical Use: Construction of Special University Timetables
- Evaluating Sets of Search Points Using Relational Algebra
- Relational computation of sets of relations
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
- Relational construction of specific timetables
Uses Software
This page was built for publication: Relation-algebraic specification and solution of special university timetabling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604453)
