{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T20:14:27Z","timestamp":1777407267775,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030922696","type":"print"},{"value":"9783030922702","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92270-2_13","type":"book-chapter","created":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T11:06:00Z","timestamp":1638788760000},"page":"145-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Implicit Learning Approach for\u00a0Solving the\u00a0Nurse Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Aymen","family":"Ben Said","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emad A.","family":"Mohammed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malek","family":"Mouhoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,7]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Aickelin, U., Li, J.: An estimation of distribution algorithm for nurse scheduling. Ann. Oper. Res. 155(1), 289\u2013309 (2007). https:\/\/doi.org\/10.1007\/s10479-007-0214-0","DOI":"10.1007\/s10479-007-0214-0"},{"key":"13_CR2","unstructured":"Alanazi, E., Mouhoub, M., Zilles, S.: The complexity of learning acyclic cp-nets. In: Kambhampati, S. (ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9\u201315 July 2016, pp. 1361\u20131367. IJCAI\/AAAI Press (2016). http:\/\/www.ijcai.org\/Abstract\/16\/196"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Alanazi, E., Mouhoub, M., Zilles, S.: The complexity of exact learning of acyclic conditional preference networks from swap examples. Artif. Intell. 278, 103182 (2020). https:\/\/doi.org\/10.1016\/j.artint.2019.103182","DOI":"10.1016\/j.artint.2019.103182"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Aparecido Constantino, A., Tozzo, E., Lankaites Pinheiro, R., Landa-Silva, D., Rom\u00e3o, W.: A variable neighbourhood search for nurse scheduling with balanced preference satisfaction. In: Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1, pp. 462\u2013470. SCITEPRESS - Science and Technology Publications, Lda (2015). https:\/\/doi.org\/10.5220\/0005364404620470","DOI":"10.5220\/0005364404620470"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Bagheri, M., Gholinejad Devin, A., Izanloo, A.: An application of stochastic programming method for nurse scheduling problem in real word hospital. Comput. Ind. Eng. 96, 192\u2013200 (2016). https:\/\/doi.org\/10.1016\/j.cie.2016.02.023, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S036083521630050X","DOI":"10.1016\/j.cie.2016.02.023"},{"issue":"8","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1864","DOI":"10.1016\/j.laa.2008.05.020","volume":"429","author":"A B\u00f6ttcher","year":"2008","unstructured":"B\u00f6ttcher, A., Wenzel, D.: The frobenius norm and the commutator. Linear Algebra Appl. 429(8), 1864\u20131885 (2008)","journal-title":"Linear Algebra Appl."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Constantino, A.A., de Melo, E.L., Landa-Silva, D., Rom\u00e3o, W.: A heuristic algorithm for nurse scheduling with balanced preference satisfaction. In: 2011 IEEE Symposium on Computational Intelligence in Scheduling (SCIS), pp. 39\u201345 (2011)","DOI":"10.1109\/SCIS.2011.5976549"},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"2289","DOI":"10.1016\/j.aej.2017.09.007","volume":"57","author":"AA El Adoly","year":"2018","unstructured":"El Adoly, A.A., Gheith, M., Nashat Fors, M.: A new formulation and solution for the nurse scheduling problem: a case study in egypt. Alexandria Eng. J. 57(4), 2289\u20132298 (2018). https:\/\/doi.org\/10.1016\/j.aej.2017.09.007","journal-title":"Alexandria Eng. J."},{"key":"13_CR9","unstructured":"Friedman, N.: A qualitative markov assumption and its implications for belief change. In: In Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI \u201996), pp. 263\u2013273. Morgan Kaufmann (1996)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Karmakar, S., Chakraborty, S., Chatterjee, T., Baidya, A., Acharyya, S.: Meta-heuristics for solving nurse scheduling problem: a comparative study. In: 2016 2nd International Conference on Advances in Computing, Communication, & Automation (ICACCA) (Fall), pp. 1\u20135 (2016)","DOI":"10.1109\/ICACCAF.2016.7748951"},{"key":"13_CR11","unstructured":"Kottke, D., Schellinger, J., Huseljic, D., Sick, B.: Limitations of assessing active learning performance at runtime. arXiv e-prints (2019). http:\/\/arxiv.org\/abs\/1901.10338"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Kumar, M., Teso, S., De Causmaecker, P., De Raedt, L.: Automating personnel rostering by learning constraints using tensors. In: 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI), pp. 697\u2013704 (2019)","DOI":"10.1109\/ICTAI.2019.00102"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Kumar, M., Teso, S., De Raedt, L.: Acquiring integer programs from data. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19, pp. 1130\u20131136 (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/158","DOI":"10.24963\/ijcai.2019\/158"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Li, J., Aickelin, U.: A bayesian optimization algorithm for the nurse scheduling problem. In: The 2003 Congress on Evolutionary Computation, 2003. CEC \u201903, vol. 3, pp. 2149\u20132156 (2003). https:\/\/doi.org\/10.1109\/CEC.2003.1299938","DOI":"10.1109\/CEC.2003.1299938"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Mouhoub, M., Marri, H.A., Alanazi, E.: Learning qualitative constraint networks. In: Alechina, N., N\u00f8rv\u00e5g, K., Penczek, W. (eds.) 25th International Symposium on Temporal Representation and Reasoning, TIME 2018, Warsaw, Poland, October 15\u201317, 2018. LIPIcs, vol. 120, pp. 19:1\u201319:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.TIME.2018.19","DOI":"10.4230\/LIPIcs.TIME.2018.19"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Passerini, A., Tack, G., Guns, T.: Introduction to the special issue on combining constraint solving with mining and learning. Artif. Intell. 244, 1\u20135 (2017). https:\/\/doi.org\/10.1016\/j.artint.2017.01.002","DOI":"10.1016\/j.artint.2017.01.002"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Setyaningsih, E., Listiowarni, I.: Categorization of exam questions based on bloom taxonomy using na\u00efve bayes and laplace smoothing. In: 2021 3rd East Indonesia Conference on Computer and Information Technology (EIConCIT), pp. 330\u2013333 (2021). https:\/\/doi.org\/10.1109\/EIConCIT50028.2021.9431862","DOI":"10.1109\/EIConCIT50028.2021.9431862"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1007\/978-3-030-58475-7_54","volume-title":"Principles and Practice of Constraint Programming","author":"DC Tsouros","year":"2020","unstructured":"Tsouros, D.C., Stergiou, K., Bessiere, C.: Omissions in constraint acquisition. In: Simonis, H. (ed.) CP 2020. LNCS, vol. 12333, pp. 935\u2013951. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_54"},{"key":"13_CR19","unstructured":"Vanhoucke, M., Maenhout, B.: Nsplib-a nurse scheduling problem library: a tool to evaluate (meta-) heuristic procedures (2007)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Vu, L., Alaghband, G.: An efficient approach for mining association rules from sparse and dense databases. In: 2014 World Congress on Computer Applications and Information Systems (WCCAIS), pp. 1\u20138 (2014)","DOI":"10.1109\/WCCAIS.2014.6916550"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1142\/S0218213008004175","volume":"17","author":"XH Vu","year":"2008","unstructured":"Vu, X.H., O\u2019Sullivan, B.: A unifying framework for generalized constraint acquisition. Int. J. Artif. Intell. Tools 17, 803\u2013833 (2008)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Wang, T., Meskens, N., Duvivier, D.: Scheduling operating theatres: mixed integer programming vs. constraint programming. Eur. J. Oper. Res. 247(2), 401\u2013413 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2015.06.008, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221715005226","DOI":"10.1016\/j.ejor.2015.06.008"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Yao, H., Hamilton, H., Butz, C.: A foundational approach to mining itemset utilities from databases. In: Proceedings of the Fourth SIAM International Conference on Data Mining, Lake Buena Vista, Florida, USA, April 22\u201324, 2004, vol. 4 (2004). https:\/\/doi.org\/10.1137\/1.9781611972740.51","DOI":"10.1137\/1.9781611972740.51"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92270-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:59:14Z","timestamp":1710259154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92270-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030922696","9783030922702"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92270-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sanur, Bali","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iconip2021.apnns.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1093","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"226","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"177","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.57","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}