A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: M. Dambrine / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6625286 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
educational timetabling | |||
| Property / zbMATH Keywords: educational timetabling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
student scheduling | |||
| Property / zbMATH Keywords: student scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
complexity analysis | |||
| Property / zbMATH Keywords: complexity analysis / rank | |||
Normal rank | |||
Revision as of 23:51, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complexity analysis and an algorithmic approach to student sectioning in existing timetables |
scientific article |
Statements
A complexity analysis and an algorithmic approach to student sectioning in existing timetables (English)
0 references
8 September 2016
0 references
educational timetabling
0 references
student scheduling
0 references
complexity analysis
0 references
