Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models (Q596433)
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: Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models |
scientific article; zbMATH DE number 2085773
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models |
scientific article; zbMATH DE number 2085773 |
Statements
Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models (English)
0 references
10 August 2004
0 references
nurse scheduling
0 references
rerostering
0 references
integer multicommodity flow problems
0 references
binary linear programming
0 references
0.9561551
0 references
0.8884578
0 references
0.87696797
0 references
0.8759548
0 references
0.86083996
0 references
0.85997117
0 references
