{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T08:56:18Z","timestamp":1780044978720,"version":"3.53.1"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031080104","type":"print"},{"value":"9783031080111","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-08011-1_20","type":"book-chapter","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T16:16:42Z","timestamp":1654791402000},"page":"300-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Learning Large Neighborhood Search for\u00a0the\u00a0Staff Rerostering Problem"],"prefix":"10.1007","author":[{"given":"Fabio F.","family":"Oberweger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elina","family":"R\u00f6nnberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Huber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"20_CR1","unstructured":"Abe, K., Xu, Z., Sato, I., Sugiyama, M.: Solving NP-hard problems on graphs with extended AlphaGo zero. arXiv preprint arXiv:1905.11623 (2020)"},{"key":"20_CR2","unstructured":"Addanki, R., Nair, V., Alizadeh, M.: Neural large neighborhood search. In: Learning Meets Combinatorial Algorithms at Conference on Neural Information Processing Systems (2020)"},{"key":"20_CR3","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: Workshop Proceedings of the 5th International Conference on Learning Representations. OpenReview.net (2017)"},{"key":"20_CR4","unstructured":"Bengio, Y., Bengio, S.: Modeling high-dimensional discrete data with multi-layer neural networks. In: Advances in Neural Information Processing Systems, vol. 12, pp. 400\u2013406. MIT Press (1999)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","volume":"226","author":"J Van den Bergh","year":"2013","unstructured":"Van den Bergh, J., Beli\u00ebn, J., De Bruecker, P., Demeulemeester, E., De Boeck, L.: Personnel scheduling: a literature review. Eur. J. Oper. Res. 226, 367\u2013385 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-030-78230-6_25","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"F Chalumeau","year":"2021","unstructured":"Chalumeau, F., Coulon, I., Cappart, Q., Rousseau, L.-M.: SeaPearl: a constraint programming solver guided by reinforcement learning. In: Stuckey, P.J. (ed.) CPAIOR 2021. LNCS, vol. 12735, pp. 392\u2013409. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78230-6_25"},{"key":"20_CR7","unstructured":"Chen, M., Gao, L., Chen, Q., Liu, Z.: Dynamic partial removal: a neural network heuristic for large neighborhood search. arXiv preprint arXiv:2005.09330 (2020)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"AT Ernst","year":"2004","unstructured":"Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. Eur. J. Oper. Res. 153, 3\u201327 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98, 23\u201347 (2003)","journal-title":"Math. Program."},{"key":"20_CR10","unstructured":"Gasse, M., Chetelat, D., Ferroni, N., Charlin, L., Lodi, A.: Exact combinatorial optimization with graph convolutional neural networks. In: Advances in Neural Information Processing Systems, vol. 32, pp. 15554\u201315566. Curran Associates, Inc. (2019)"},{"key":"20_CR11","volume-title":"Deep Learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge (2016)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Gori, M., Monfardini, G., Scarselli, F.: A new model for learning in graph domains. In: 2005 Proceedings of the IEEE International Joint Conference on Neural Networks, vol. 2, pp. 729\u2013734. IEEE (2005)","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"20_CR13","first-page":"3293","volume":"27","author":"H He","year":"2014","unstructured":"He, H., Daume, H., III., Eisner, J.M.: Learning to search in branch and bound algorithms. Adv. Neural. Inf. Process. Syst. 27, 3293\u20133301 (2014)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"20_CR14","unstructured":"Hottung, A., Tierney, K.: Neural large neighborhood search for the capacitated vehicle routing problem. In: Proceedings of the 24th European Conference on Artificial Intelligence. FAIA, vol. 325, pp. 443\u2013450. IOS Press (2020)"},{"key":"20_CR15","volume-title":"Dynamic Programming and Markov Processes","author":"RA Howard","year":"1960","unstructured":"Howard, R.A.: Dynamic Programming and Markov Processes. Wiley, Hoboken (1960)"},{"key":"20_CR16","unstructured":"Huang, J., Patwary, M., Diamos, G.: Coloring big graphs with AlphaGo zero. arXiv preprint arXiv:1902.10162 (2019)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Huber, M., Raidl, G.R.: Learning beam search: utilizing machine learning to guide beam search for solving combinatorial optimization problems. In: Machine Learning, Optimization, and Data Science - 7th International Conference, LOD 2021. LNCS, vol. 11943. Springer (2021, to appear)","DOI":"10.1007\/978-3-030-95470-3_22"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-030-62867-3_12","volume-title":"Optimization and Applications","author":"T Jatschka","year":"2020","unstructured":"Jatschka, T., Oberweger, F.F., Rodemann, T., Raidl, G.R.: Distributing battery swapping stations for electric scooters in an urban area. In: Olenev, N., Evtushenko, Y., Khachay, M., Malkova, V. (eds.) OPTIMA 2020. LNCS, vol. 12422, pp. 150\u2013165. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62867-3_12"},{"key":"20_CR19","unstructured":"Khalil, E., Dai, H., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Advances in Neural Information Processing Systems, vol. 30, pp. 6348\u20136358. Curran Associates, Inc. (2017)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Bodic, P.L., Song, L., Nemhauser, G.L., Dilkina, B.N.: Learning to branch in mixed integer programming. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence, pp. 724\u2013731. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"20_CR21","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: Proceedings of the 3rd International Conference on Learning Representations (2015)"},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1016\/j.cor.2010.12.012","volume":"38","author":"B Maenhout","year":"2011","unstructured":"Maenhout, B., Vanhoucke, M.: An evolutionary approach for the nurse rerostering problem. Comput. Oper. Res. 38, 1400\u20131411 (2011)","journal-title":"Comput. Oper. Res."},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/j.omega.2012.10.010","volume":"41","author":"B Maenhout","year":"2013","unstructured":"Maenhout, B., Vanhoucke, M.: Reconstructing nurse schedules: computational insights in the problem size parameters. Omega 41, 903\u2013918 (2013)","journal-title":"Omega"},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/TNN.2008.2010350","volume":"20","author":"A Micheli","year":"2009","unstructured":"Micheli, A.: Neural network for graphs: a contextual constructive approach. IEEE Trans. Neural Netw. 20, 498\u2013511 (2009)","journal-title":"IEEE Trans. Neural Netw."},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1022907212477","volume":"119","author":"M Moz","year":"2003","unstructured":"Moz, M., Pato, M.V.: An integer multicommodity flow model applied to the rerostering of nurse schedules. Ann. Oper. Res. 119, 285\u2013301 (2003)","journal-title":"Ann. Oper. Res."},{"key":"20_CR26","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/B:ANOR.0000019104.39239.ed","volume":"128","author":"M Moz","year":"2004","unstructured":"Moz, M., Pato, M.V.: Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models. Ann. Oper. Res. 128, 179\u2013197 (2004)","journal-title":"Ann. Oper. Res."},{"key":"20_CR27","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.cor.2005.03.019","volume":"34","author":"M Moz","year":"2007","unstructured":"Moz, M., Pato, M.V.: A genetic algorithm approach to a nurse rerostering problem. Comput. Oper. Res. 34, 667\u2013691 (2007)","journal-title":"Comput. Oper. Res."},{"key":"20_CR28","unstructured":"Muller, L.F.: An adaptive large neighborhood search algorithm for the resource-constrained project scheduling problem. In: 2009 Proceedings of the VIII Metaheuristics International Conference (2009)"},{"key":"20_CR29","unstructured":"Nair, V., et al.: Solving mixed integer programs using neural networks. arXiv preprint arXiv:2012.13349 (2020)"},{"key":"20_CR30","unstructured":"Negrinho, R., Gormley, M.R., Gordon, G.J.: Learning beam search policies via imitation learning. In: Advances in Neural Information Processing Systems, vol. 31, pp. 10675\u201310684. Curran Associates Inc. (2018)"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Oberweger, F.F.: A learning large neighborhood search for the staff rerostering problem. Diploma thesis, Institute of Logic and Computation, TU Wien, Austria (2021)","DOI":"10.1007\/978-3-031-08011-1_20"},{"key":"20_CR32","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10732-007-9040-4","volume":"14","author":"MV Pato","year":"2008","unstructured":"Pato, M.V., Moz, M.: Solving a bi-objective nurse rerostering problem by using a utopic pareto genetic heuristic. J. Heurist. 14, 359\u2013374 (2008)","journal-title":"J. Heurist."},{"key":"20_CR33","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 399\u2013419. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_13"},{"key":"20_CR34","unstructured":"Pomerleau, D.A.: ALVINN: an autonomous land vehicle in a neural network. In: Advances in Neural Information Processing Systems, vol. 1, pp. 305\u2013313. MIT Press (1988)"},{"key":"20_CR35","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-1-4614-5094-8_8","volume-title":"Systems Analysis Tools for Better Healthcare Delivery","author":"E R\u00f6nnberg","year":"2012","unstructured":"R\u00f6nnberg, E., Larsson, T., Bertilsson, A.: Automatic scheduling of nurses: what does it take in practice? In: Pardalos, P., Georgiev, P., Papajorgji, P., Neugaard, B. (eds.) Systems Analysis Tools for Better Healthcare Delivery. Springer Optimization and Its Applications, vol. 74, pp. 151\u2013178. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4614-5094-8_8"},{"key":"20_CR36","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2008","unstructured":"Scarselli, F., Gori, M., Tsoi, A.C., Hagenbuchner, M., Monfardini, G.: The graph neural network model. IEEE Trans. Neural Netw. 20, 61\u201380 (2008)","journal-title":"IEEE Trans. Neural Netw."},{"key":"20_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-319-93417-4_38","volume-title":"The Semantic Web","author":"M Schlichtkrull","year":"2018","unstructured":"Schlichtkrull, M., Kipf, T.N., Bloem, P., van\u00a0den Berg, R., Titov, I., Welling, M.: Modeling relational data with graph convolutional networks. In: Gangemi, A., et al. (eds.) ESWC 2018. LNCS, vol. 10843, pp. 593\u2013607. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93417-4_38"},{"key":"20_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming \u2014 CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"key":"20_CR39","unstructured":"Song, J., Lanka, R., Yue, Y., Dilkina, B.: A general large neighborhood search framework for solving integer linear programs. In: Advances in Neural Information Processing Systems, vol. 33, pp. 20012\u201320023. Curran Associates, Inc. (2020)"},{"key":"20_CR40","unstructured":"Sonnerat, N., Wang, P., Ktena, I., Bartunov, S., Nair, V.: Learning a large neighborhood search algorithm for mixed integer programs. arXiv preprint arXiv:2107.10201 (2021)"},{"key":"20_CR41","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-030-30241-2_49","volume-title":"Progress in Artificial Intelligence","author":"AA Syed","year":"2019","unstructured":"Syed, A.A., Akhnoukh, K., Kaltenhaeuser, B., Bogenberger, K.: Neural network based large neighborhood search algorithm for ride hailing services. In: Moura Oliveira, P., Novais, P., Reis, L.P. (eds.) EPIA 2019. LNCS (LNAI), vol. 11804, pp. 584\u2013595. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30241-2_49"},{"key":"20_CR42","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems, vol. 28, pp. 2692\u20132700. Curran Associates, Inc. (2015)"},{"key":"20_CR43","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.cor.2018.12.014","volume":"104","author":"TI Wickert","year":"2019","unstructured":"Wickert, T.I., Smet, P., Berghe, G.V.: The nurse rerostering problem: strategies for reconstructing disrupted schedules. Comput. Oper. Res. 104, 319\u2013337 (2019)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08011-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T18:32:51Z","timestamp":1727375571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08011-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031080104","9783031080111"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08011-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/usc.edu\/cpaior-2022\/","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":"60","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":"28","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":"0","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":"47% - 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":"3","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":"4","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)"}}]}}