Relation-algebraic specification and solution of special university timetabling problems
From MaRDI portal
Publication:604453
Recommendations
- Relation Algebra and RelView in Practical Use: Construction of Special University Timetables
- Relational construction of specific timetables
- scientific article; zbMATH DE number 1728545
- On a conjecture for the university timetabling problem
- University timetabling by constraint-based reasoning: A case study
Cites work
- scientific article; zbMATH DE number 3471788 (Why is no real title available?)
- scientific article; zbMATH DE number 1953899 (Why is no real title available?)
- A Boolean matrix iteration in timetable construction
- Computer Algebra in Scientific Computing
- Evaluating Sets of Search Points Using Relational Algebra
- Handbook of Graph Theory
- Orders, lattices and relations with applications
- Relation-algebraic computation of fixed points with applications
- Relational Methods in Computer Science
- Theory and applications of relational structures as knowledge instruments II. International workshops of COST Action 274, TARSKI, 2002--2005. Selected revised papers
- Theory and applications of relational structures as knowledge instruments. COST Action 274, TARSKI. Revised papers
Cited in
(5)- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
- Relation Algebra and RelView in Practical Use: Construction of Special University Timetables
- Evaluating Sets of Search Points Using Relational Algebra
- Relational construction of specific timetables
- Relational computation of sets of relations
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)