Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models (Q596433): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/b:anor.0000019104.39239.ed / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2062690651 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:55, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models |
scientific article |
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