Pages that link to "Item:Q2514811"
From MaRDI portal
The following pages link to New approaches to nurse rostering benchmark instances (Q2514811):
Displayed 16 items.
- A-priori upper bounds for the set covering problem (Q271942) (← links)
- An assessment of a days off decomposition approach to personnel shift scheduling (Q284419) (← links)
- Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
- Genetic based discrete particle swarm optimization for elderly day care center timetabling (Q342133) (← links)
- A hybrid integer and constraint programming approach to solve nurse rostering problems (Q1652269) (← links)
- A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
- Accelerating the branch-and-price algorithm using machine learning (Q1653391) (← links)
- The nurse rerostering problem: strategies for reconstructing disrupted schedules (Q1725622) (← links)
- Simulated annealing approach to nurse rostering benchmark and real-world instances (Q1730622) (← links)
- The second international nurse rostering competition (Q1730710) (← links)
- Modeling and solving staff scheduling with partial weighted maxSAT (Q1730743) (← links)
- Integer programming model extensions for a multi-stage nurse rostering problem (Q1730747) (← links)
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems (Q1751653) (← links)
- Dynamic job assignment: a column generation approach with an application to surgery allocation (Q1991107) (← links)
- A graph-based formulation for the shift rostering problem (Q2301967) (← links)
- Solving the general employee scheduling problem (Q2333146) (← links)