A computational study of local search algorithms for Italian high-school timetabling (Q930154)
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 computational study of local search algorithms for Italian high-school timetabling |
scientific article; zbMATH DE number 5291489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational study of local search algorithms for Italian high-school timetabling |
scientific article; zbMATH DE number 5291489 |
Statements
A computational study of local search algorithms for Italian high-school timetabling (English)
0 references
23 June 2008
0 references
School timetabling
0 references
Simulated annealing
0 references
Very large scale neighborhood search
0 references
0.85256427526474
0 references
0.8504054546356201
0 references
0.8500482439994812
0 references
0.8443483114242554
0 references
0.8374325037002563
0 references
