Publisher
Springer Nature Switzerland
Reference24 articles.
1. Baskaran, G., Bargiela, A., Qu, R.: Integer programming: using branch and bound to solve the nurse scheduling problem. In: 2014 International Conference on Artificial Intelligence and Manufacturing Engineering (IIE ICAIME2014) (2014)
2. Ben Said, A., Mouhoub, M.: A constraint satisfaction problem (CSP) approach for the nurse scheduling problem. In: Symposium Series on Computational Intelligence (2022)
3. Bidar, M., Mouhoub, M.: Nature-inspired techniques for dynamic constraint satisfaction problems. Oper. Res. Forum 3(2), 1–33 (2022)
4. Burke, E., Cowling, P., De Causmaecker, P., Berghe, G.V.: A memetic approach to the nurse rostering problem. Appl. Intell. 15(3), 199–214 (2001)
5. Camacho-Villalón, C.L., Dorigo, M., Stützle, T.: Exposing the grey wolf, moth-flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by bestial metaphors. Int. Trans. Oper. Res. (2022)