Timetable construction: the algorithms and complexity perspective (Q475200)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6374068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Timetable construction: the algorithms and complexity perspective |
scientific article; zbMATH DE number 6374068 |
Statements
Timetable construction: the algorithms and complexity perspective (English)
0 references
26 November 2014
0 references
timetabling
0 references
algorithms
0 references
NP-completeness
0 references
0 references
0.8175879120826721
0 references
0.80447918176651
0 references
0.7986912131309509
0 references
0.7855186462402344
0 references
0.7847710251808167
0 references
