Finding near optimal solutions to the thesis defense timetabling problem by exploiting symmetries (Q6579104)
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 7887257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding near optimal solutions to the thesis defense timetabling problem by exploiting symmetries |
scientific article; zbMATH DE number 7887257 |
Statements
Finding near optimal solutions to the thesis defense timetabling problem by exploiting symmetries (English)
0 references
25 July 2024
0 references
scheduling
0 references
thesis defense timetabling
0 references
constraint programming
0 references
symmetries
0 references
0.7018265724182129
0 references
0.6956855654716492
0 references
0.6909990906715393
0 references
0.685886800289154
0 references
0.6838653683662415
0 references
