Efficient solutions for a university timetabling problem through integer programming (Q1887870)
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: Efficient solutions for a university timetabling problem through integer programming |
scientific article; zbMATH DE number 2117493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient solutions for a university timetabling problem through integer programming |
scientific article; zbMATH DE number 2117493 |
Statements
Efficient solutions for a university timetabling problem through integer programming (English)
0 references
22 November 2004
0 references
Timetabling
0 references
University timetabling
0 references
Integer programming
0 references
0 references
0.886323094367981
0 references
0.8684332370758057
0 references
0.8280129432678223
0 references
0.816156268119812
0 references
0.813090443611145
0 references
