Improved local search approaches to solve the post enrolment course timetabling problem (Q1753553)
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: Improved local search approaches to solve the post enrolment course timetabling problem |
scientific article; zbMATH DE number 6875844
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved local search approaches to solve the post enrolment course timetabling problem |
scientific article; zbMATH DE number 6875844 |
Statements
Improved local search approaches to solve the post enrolment course timetabling problem (English)
0 references
29 May 2018
0 references
timetabling
0 references
combinatorial optimization
0 references
local search
0 references
tabu search with sampling and perturbation (TSSP)
0 references
simulated annealing with reheating (SAR)
0 references
0 references
0.797601044178009
0 references
0.7905445694923401
0 references
0.7713569402694702
0 references
0.7658433318138123
0 references
0.7657954692840576
0 references
