Pages that link to "Item:Q320874"
From MaRDI portal
The following pages link to Polynomially solvable personnel rostering problems (Q320874):
Displaying 9 items.
- Simulated annealing approach to nurse rostering benchmark and real-world instances (Q1730622) (← links)
- The second international nurse rostering competition (Q1730710) (← links)
- Local search neighbourhoods for dealing with a novel nurse rostering model (Q1761887) (← links)
- Towards a reference model for timetabling and rostering (Q1761899) (← links)
- A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem (Q1983752) (← links)
- Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds (Q2030469) (← links)
- A flexible mixed integer programming-based system for real-world nurse rostering (Q2124911) (← links)
- A graph-based formulation for the shift rostering problem (Q2301967) (← links)
- On the complexity of nurse rostering problems (Q6556163) (← links)
