A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A complexity analysis and an algorithmic approach to student sectioning in existing timetables |
scientific article; zbMATH DE number 6625286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complexity analysis and an algorithmic approach to student sectioning in existing timetables |
scientific article; zbMATH DE number 6625286 |
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
0 references
0.8030716776847839
0 references
0.7989944219589233
0 references
0.7943542003631592
0 references
0.7866808176040649
0 references
