scientific article
From MaRDI portal
Publication:2779802
zbMath0982.68955MaRDI QIDQ2779802
Publication date: 15 April 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2079/20790064
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 (14)
Elective course student sectioning at Danish high schools ⋮ A complexity analysis and an algorithmic approach to student sectioning in existing timetables ⋮ A decision support approach to automatic timetabling in higher education institutions ⋮ An ILP based heuristic for a generalization of the post-enrollment course timetabling problem ⋮ A matheuristic for customized multi-level multi-criteria university timetabling ⋮ An automated university course timetabling system developed in a distributed environment: a case study. ⋮ Timetable construction: the algorithms and complexity perspective ⋮ Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study ⋮ Optimal student sectioning on mandatory courses with various sections numbers ⋮ New integer linear programming approaches for course timetabling ⋮ A university-timetabling problem and its solution using Benders' partitioning---a case study ⋮ Curriculum based course timetabling: new solutions to Udine benchmark instances ⋮ An overview of curriculum-based course timetabling ⋮ Partitioning students into cohorts during COVID-19
This page was built for publication:
