Complexity results for the basic residency scheduling problem (Q398919)
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: Complexity results for the basic residency scheduling problem |
scientific article; zbMATH DE number 6331202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results for the basic residency scheduling problem |
scientific article; zbMATH DE number 6331202 |
Statements
Complexity results for the basic residency scheduling problem (English)
0 references
18 August 2014
0 references
medical school
0 references
residency program
0 references
alternate optima
0 references
schedule perturbation
0 references
0 references
0 references
0 references
0.7688227891921997
0 references
0.750373125076294
0 references
0.7399161458015442
0 references
0.722724974155426
0 references
0.7215595245361328
0 references
