Cited in
(8)- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
- Modelling and evaluation issues in nurse rostering
- HIBISCUS
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- A heuristic algorithm based on multi-assignment procedures for nurse scheduling
- Comparison and hybridization of crossover operators for the nurse scheduling problem
- On the characterization and generation of nurse scheduling problem instances
- A graph-based formulation for the shift rostering problem
This page was built for software: NSPLib
