New constraints and features for the university course timetabling problem
From MaRDI portal
Publication:4596448
DOI10.1007/978-3-319-55702-1_14zbMATH Open1375.90178OpenAlexW2737177649MaRDI QIDQ4596448FDOQ4596448
Authors:
Publication date: 1 December 2017
Published in: Operations Research Proceedings 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-55702-1_14
Recommendations
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Cited In (10)
- University timetabling by constraint-based reasoning: A case study
- University course timetabling problem using a heuristic approach based on uniform teaching resources
- Developing compact course timetables with optimized student flows
- Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem
- A strategic view of university timetabling
- Decomposition, reformulation, and diving in university course timetabling
- Answer set programming as a modeling language for course timetabling
- On a conjecture for the university timetabling problem
- Title not available (Why is that?)
- Evolutionary Computation in Combinatorial Optimization
This page was built for publication: New constraints and features for the university course timetabling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596448)