{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T15:12:19Z","timestamp":1778512339125,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T00:00:00Z","timestamp":1570492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T00:00:00Z","timestamp":1570492800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s12532-019-00172-4","type":"journal-article","created":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T06:35:41Z","timestamp":1570516541000},"page":"417-450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["A rotation-based branch-and-price approach for the nurse scheduling problem"],"prefix":"10.1007","volume":"12","author":[{"given":"Antoine","family":"Legrain","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00e9my","family":"Omer","sequence":"additional","affiliation":[]},{"given":"Samuel","family":"Rosat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,8]]},"reference":[{"issue":"2","key":"172_CR1","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.ejor.2003.06.046","volume":"164","author":"JF Bard","year":"2005","unstructured":"Bard, J.F., Purnomo, H.W.: Preference scheduling for nurses using column generation. Eur. J. Oper. Res. 164(2), 510\u2013534 (2005). https:\/\/doi.org\/10.1016\/j.ejor.2003.06.046","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"172_CR2","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46(3), 316\u2013329 (1998). https:\/\/doi.org\/10.1287\/opre.46.3.316","journal-title":"Oper. Res."},{"issue":"3","key":"172_CR3","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.ejor.2006.10.060","volume":"189","author":"J Beli\u00ebn","year":"2008","unstructured":"Beli\u00ebn, J., Demeulemeester, E.: A branch-and-price approach for integrating nurse and surgery scheduling. Eur. J. Oper. Res. 189(3), 652\u2013668 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2006.10.060","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"172_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10951-013-0338-9","volume":"17","author":"V Boyer","year":"2014","unstructured":"Boyer, V., Gendron, B., Rousseau, L.M.: A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem. J. Sched. 17(2), 185\u2013197 (2014). https:\/\/doi.org\/10.1007\/s10951-013-0338-9","journal-title":"J. Sched."},{"key":"172_CR5","unstructured":"Braekers, K., Janssens, G.K.: Shortest route problem with soft time windows. In: Onggo, S., Kavicka, A. (eds.) The European Simulation and Modelling Conference, pp. 279\u2013283 (2013)"},{"issue":"1","key":"172_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ejor.2014.01.039","volume":"237","author":"EK Burke","year":"2014","unstructured":"Burke, E.K., Curtois, T.: New approaches to nurse rostering benchmark instances. Eur. J. Oper. Res. 237(1), 71\u201381 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2014.01.039","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"172_CR7","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"EK Burke","year":"2004","unstructured":"Burke, E.K., De Causmaecker, P., Berghe, G.V., Van Landeghem, H.: The state of the art of nurse rostering. J. Sched. 7(6), 441\u2013499 (2004). https:\/\/doi.org\/10.1023\/B:JOSH.0000046076.75950.0b","journal-title":"J. Sched."},{"key":"172_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-2816-0","author":"S Ceschia","year":"2018","unstructured":"Ceschia, S., Dang, N., De Causmaecker, P., Haspeslagh, S., Schaerf, A.: The second international nurse rostering competition. Ann. Oper. Res. (2018). https:\/\/doi.org\/10.1007\/s10479-018-2816-0","journal-title":"Ann. Oper. Res."},{"key":"172_CR9","unstructured":"Ceschia, S., Dang, N., De\u00a0Causmaecker, P., Haspeslagh, S., Schaerf, A.: Solving the INRC-II nurse rostering problem by simulated annealing based on large-scale neighborhoods. In: Proceedings of the 12th International Conference on Practice and Theory of Automated Timetabling (PATAT-2018) (2018)"},{"key":"172_CR10","unstructured":"Ceschia, S., Dang, N.T.T., De Causmaecker, P., Haspeslagh, S., Schaerf, A.: The second international nurse rostering competition. In: Proceedings of the 10th International Conference of the Practice and Theory of Automated Timetabling (PATAT-2014), pp. 554\u2013556 (2014)"},{"issue":"3","key":"172_CR11","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0377-2217(03)00021-3","volume":"151","author":"B Cheang","year":"2003","unstructured":"Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems\u2014a bibliographic survey. Eur. J. Oper. Res. 151(3), 447\u2013460 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"172_CR12","volume-title":"Column Generation","author":"G Desaulniers","year":"2006","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.M.: Column Generation, vol. 5. Springer, Berlin (2006)"},{"issue":"2","key":"172_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1287\/trsc.24.2.145","volume":"24","author":"Y Dumas","year":"1990","unstructured":"Dumas, Y., Soumis, F., Desrosiers, J.: Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transp. Sci. 24(2), 145\u2013152 (1990). https:\/\/doi.org\/10.1287\/trsc.24.2.145","journal-title":"Transp. Sci."},{"issue":"1","key":"172_CR14","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1080\/00031305.1989.10475612","volume":"43","author":"M Frigge","year":"1989","unstructured":"Frigge, M., Hoaglin, D.C., Iglewicz, B.: Some implementations of the boxplot. Am. Stat. 43(1), 50\u201354 (1989)","journal-title":"Am. Stat."},{"key":"172_CR15","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/978-1-4615-5501-8_5","volume-title":"Operations Research in the Airline Industry, International Series in Operations Research and Management Science, Chapter 5","author":"M Gamache","year":"1998","unstructured":"Gamache, M., Soumis, F.: A method for optimally solving the rostering problem. In: Yu, G. (ed.) Operations Research in the Airline Industry, International Series in Operations Research and Management Science, Chapter 5, vol. 9, pp. 124\u2013157. Springer, New York (1998)"},{"issue":"2","key":"172_CR16","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1287\/opre.47.2.247","volume":"47","author":"M Gamache","year":"1999","unstructured":"Gamache, M., Soumis, F., Marquis, G., Desrosiers, J.: A column generation approach for large-scale aircrew rostering problems. Oper. Res. 47(2), 247\u2013263 (1999)","journal-title":"Oper. Res."},{"key":"172_CR17","unstructured":"Garcia, R.: Resource constrained shortest paths and extensions. Ph.D. Thesis, Georgia Institute of Technology, GA, USA (2009)"},{"issue":"3","key":"172_CR18","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/j.ejor.2016.01.036","volume":"252","author":"M G\u00e9rard","year":"2016","unstructured":"G\u00e9rard, M., Clautiaux, F., Sadykov, R.: Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce. Eur. J. Oper. Res. 252(3), 1019\u20131030 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2016.01.036","journal-title":"Eur. J. Oper. Res."},{"key":"172_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.endm.2017.03.005","volume":"58","author":"RA Gomes","year":"2017","unstructured":"Gomes, R.A., Toffolo, T.A., Santos, H.G.: Variable neighborhood search accelerated column generation for the nurse rostering problem. Electron. Notes Discret. Math. 58, 31\u201338 (2017). https:\/\/doi.org\/10.1016\/j.endm.2017.03.005 . 4th International Conference on Variable Neighborhood Search","journal-title":"Electron. Notes Discret. Math."},{"issue":"1","key":"172_CR20","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10479-012-1062-0","volume":"218","author":"S Haspeslagh","year":"2014","unstructured":"Haspeslagh, S., De Causmaecker, P., Schaerf, A., St\u00f8levik, M.: The first international nurse rostering competition 2010. Ann. Oper. Res. 218(1), 221\u2013236 (2014). https:\/\/doi.org\/10.1007\/s10479-012-1062-0","journal-title":"Ann. Oper. Res."},{"issue":"12","key":"172_CR21","doi-asserted-by":"publisher","first-page":"3331","DOI":"10.1016\/j.cor.2012.04.018","volume":"39","author":"F He","year":"2012","unstructured":"He, F., Qu, R.: A constraint programming based column generation approach to nurse rostering problems. Comput. Oper. Res. 39(12), 3331\u20133343 (2012). https:\/\/doi.org\/10.1016\/j.cor.2012.04.018","journal-title":"Comput. Oper. Res."},{"key":"172_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/0-387-25486-2_2","volume-title":"Column Generation, Chapter 2","author":"S Irnich","year":"2005","unstructured":"Irnich, S., Desaulniers, G.: Shortest path problems with resource constraints. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, Chapter 2, pp. 33\u201365. Springer, Boston (2005)"},{"issue":"1","key":"172_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(97)00330-5","volume":"107","author":"B Jaumard","year":"1998","unstructured":"Jaumard, B., Semet, F., Vovor, T.: A generalized linear programming model for nurse scheduling. Eur. J. Oper. Res. 107(1), 1\u201318 (1998). https:\/\/doi.org\/10.1016\/S0377-2217(97)00330-5","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20134","key":"172_CR24","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:ANOR.0000019091.54417.ca","volume":"127","author":"N Kohl","year":"2004","unstructured":"Kohl, N., Karisch, S.E.: Airline crew rostering: problem types, modeling, and optimization. Ann. Oper. Res. 127(1\u20134), 223\u2013257 (2004)","journal-title":"Ann. Oper. Res."},{"key":"172_CR25","doi-asserted-by":"publisher","unstructured":"Legrain, A., Rosat, S., Omer, J.: legraina\/nursescheduler: static rostering (2019). https:\/\/doi.org\/10.5281\/zenodo.3460634","DOI":"10.5281\/zenodo.3460634"},{"issue":"1","key":"172_CR26","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10951-009-0108-x","volume":"13","author":"B Maenhout","year":"2010","unstructured":"Maenhout, B., Vanhoucke, M.: Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem. J. Sched. 13(1), 77\u201393 (2010). https:\/\/doi.org\/10.1007\/s10951-009-0108-x","journal-title":"J. Sched."},{"key":"172_CR27","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, pp. 399\u2013419. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_13 . Chapter 13"},{"issue":"4","key":"172_CR28","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1002\/net.20332","volume":"54","author":"E Prescott-Gagnon","year":"2009","unstructured":"Prescott-Gagnon, E., Desaulniers, G., Rousseau, L.M.: A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54(4), 190\u2013204 (2009). https:\/\/doi.org\/10.1002\/net.20332","journal-title":"Networks"},{"key":"172_CR29","first-page":"827","volume":"8","author":"AG Qurashi","year":"2010","unstructured":"Qurashi, A.G., Taniguchi, E., Yamada, T.: Column generation-based heuristics for vehicle routing problem with soft time windows. J. East. Asia Soc. Trans. Stud. 8, 827\u2013841 (2010)","journal-title":"J. East. Asia Soc. Trans. Stud."},{"issue":"1","key":"172_CR30","first-page":"48","volume":"2","author":"AG Qurashi","year":"2012","unstructured":"Qurashi, A.G., Taniguchi, E., Yamada, T.: Exact solution for vehicle routing problem with soft time windows and dynamic travel time. Asian Trans. Stud. 2(1), 48\u201363 (2012)","journal-title":"Asian Trans. Stud."},{"issue":"5","key":"172_CR31","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0005-1098(78)90001-8","volume":"14","author":"J Richalet","year":"1978","unstructured":"Richalet, J., Rault, A., Testud, J., Papon, J.: Model predictive heuristic control: applications to industrial processes. Automatica 14(5), 413\u2013428 (1978). https:\/\/doi.org\/10.1016\/0005-1098(78)90001-8","journal-title":"Automatica"},{"issue":"3","key":"172_CR32","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1287\/opre.47.2.247","volume":"40","author":"M Saddoune","year":"2013","unstructured":"Saddoune, M., Desaulniers, G., Soumis, F.: Aircrew pairings with possible repetitions of the same flight number. Comput. Oper. Res. 40(3), 805\u2013814 (2013). https:\/\/doi.org\/10.1287\/opre.47.2.247","journal-title":"Comput. Oper. Res."},{"key":"172_CR33","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1287\/ijoc.2018.0822","volume":"31","author":"R Sadykov","year":"2018","unstructured":"Sadykov, R., Vanderbeck, F., Pessoa, A., Tahiri, I., Uchoa, E.: Primal Heuristics for Branch-and-Price: the assets of diving methods. INFORMS J. Comput. 31, 251\u2013267 (2018)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"172_CR34","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10479-014-1594-6","volume":"239","author":"HG Santos","year":"2016","unstructured":"Santos, H.G., Toffolo, T.A., Gomes, R.A., Ribas, S.: Integer programming techniques for the nurse rostering problem. Ann. Oper. Res. 239(1), 225\u2013251 (2016)","journal-title":"Ann. Oper. Res."},{"key":"172_CR35","unstructured":"Wickert, T.I., Santori, C.S., Buriol, L.S.: A fix-and-optimize VNS algorithm applied to the nurse rostering problem. In: Proceedings of the Sixth International Workshop on Model-based Metaheuristic (Matheuristics-2016), pp. 1\u201312 (2016)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00172-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-019-00172-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00172-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T18:15:20Z","timestamp":1721844920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-019-00172-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,8]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["172"],"URL":"https:\/\/doi.org\/10.1007\/s12532-019-00172-4","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,8]]},"assertion":[{"value":"22 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}