A clique-based algorithm for constructing feasible timetables (Q3093045)
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 clique-based algorithm for constructing feasible timetables |
scientific article; zbMATH DE number 5957059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A clique-based algorithm for constructing feasible timetables |
scientific article; zbMATH DE number 5957059 |
Statements
A clique-based algorithm for constructing feasible timetables (English)
0 references
12 October 2011
0 references
timetabling
0 references
feasible timetable
0 references
heuristic
0 references
sequential techniques
0 references
clique
0 references
0.8011271953582764
0 references
0.779509425163269
0 references
0.7609312534332275
0 references
