scientific article
From MaRDI portal
Publication:2779799
zbMath0982.68769MaRDI QIDQ2779799
H. M. M. ten Eikelder, R. J. Willemen
Publication date: 15 April 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2079/20790018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (12)
Efficient solutions for a university timetabling problem through integer programming ⋮ School timetabling for quality student and teacher schedules ⋮ A complexity analysis and an algorithmic approach to student sectioning in existing timetables ⋮ Mathematical models and algorithms for a high school timetabling problem ⋮ A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem ⋮ An integer programming formulation for a case study in university timetabling. ⋮ A survey of school timetabling research ⋮ Optimal student sectioning on mandatory courses with various sections numbers ⋮ Applying evolutionary computation to the school timetabling problem: The Greek case ⋮ Decomposition of university course timetabling. A systematic study of subproblems and their complexities ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ An assignment problem and its application in education domain: a review and potential path
This page was built for publication:
