Dynamic programming with approximation function for nurse scheduling
Although dynamic programming could ideally solve any combinatorial optimization problem, the curse of dimensionality of the search space seriously limits its application to large optimization problems. For example, only few papers in the literature have reported the application of dynamic programmin...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer Verlag
2016
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/35585/ |