Solving a nurse scheduling problem with knapsacks, networks and tabu search (Q3156615): 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.1057/palgrave.jors.2600970 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021010829 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:42, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a nurse scheduling problem with knapsacks, networks and tabu search |
scientific article |
Statements
Solving a nurse scheduling problem with knapsacks, networks and tabu search (English)
0 references
10 January 2005
0 references
manpower scheduling
0 references
integer programming
0 references
tabu search
0 references
health
0 references
