{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T17:32:31Z","timestamp":1788283951588,"version":"build-2803163510"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T00:00:00Z","timestamp":1709596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T00:00:00Z","timestamp":1709596800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI 2027677"],"award-info":[{"award-number":["CMMI 2027677"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10479-024-05883-z","type":"journal-article","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T05:01:41Z","timestamp":1709614901000},"page":"1191-1221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Visiting nurses assignment and routing for decentralized telehealth service networks"],"prefix":"10.1007","volume":"341","author":[{"given":"Tan","family":"Yu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongpei","family":"Guan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6214-5876","authenticated-orcid":false,"given":"Xiang","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,5]]},"reference":[{"key":"5883_CR1","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s11590-015-0878-3","volume":"10","author":"S Afifi","year":"2016","unstructured":"Afifi, S., Dang, D. C., & Moukrim, A. (2016). Heuristic solutions for the vehicle routing problem with time windows and synchronized visits. Optimization Letters, 10, 511\u2013525. https:\/\/doi.org\/10.1007\/s11590-015-0878-3","journal-title":"Optimization Letters"},{"issue":"2","key":"5883_CR2","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.outlook.2013.10.009","volume":"62","author":"SH Bae","year":"2014","unstructured":"Bae, S. H., & Fabry, D. (2014). Assessing the relationships between nurse work hours\/overtime and nurse and patient outcomes: Systematic literature review. Nursing Outlook, 62(2), 138\u2013156. https:\/\/doi.org\/10.1016\/j.outlook.2013.10.009","journal-title":"Nursing Outlook"},{"issue":"2","key":"5883_CR3","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1080\/03772063.2019.1642802","volume":"68","author":"S Bahadori-Chinibelagh","year":"2022","unstructured":"Bahadori-Chinibelagh, S., Fathollahi-Fard, A. M., & Hajiaghaei-Keshteli, M. (2022). Two constructive algorithms to address a multi-depot home healthcare routing problem. IETE Journal of Research, 68(2), 1108\u20131114. https:\/\/doi.org\/10.1080\/03772063.2019.1642802","journal-title":"IETE Journal of Research"},{"issue":"3","key":"5883_CR4","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., et al. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46(3), 316\u2013329. https:\/\/doi.org\/10.1287\/opre.46.3.316","journal-title":"Operations Research"},{"issue":"2","key":"5883_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.3230110204","volume":"11","author":"L Bodin","year":"1981","unstructured":"Bodin, L., & Golden, B. (1981). Classification in vehicle routing and scheduling. Networks, 11(2), 97\u2013108. https:\/\/doi.org\/10.1002\/net.3230110204","journal-title":"Networks"},{"issue":"3","key":"5883_CR6","first-page":"86","volume":"4","author":"T Boynton","year":"2014","unstructured":"Boynton, T., Kelly, L., Perez, A., et al. (2014). Banner mobility assessment tool for nurses: Instrument validation. Am J SPHM, 4(3), 86\u201392.","journal-title":"Am J SPHM"},{"issue":"11","key":"5883_CR7","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1097\/00005650-198511000-00005","volume":"23","author":"LG Branch","year":"1985","unstructured":"Branch, L. G., & Nemeth, K. T. (1985). When elders fail to visit physicians. Medical Care, 23(11), 1265\u20131275. https:\/\/doi.org\/10.1097\/00005650-198511000-00005","journal-title":"Medical Care"},{"key":"5883_CR8","unstructured":"Bureau of Labor Statistics (2022) Occupational employment and wage statistics 29-1141 registered nurses. https:\/\/www.bls.gov\/oes\/current\/oes291141.htm"},{"issue":"1","key":"5883_CR9","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/S0377-2217(98)00136-2","volume":"116","author":"ZL Chen","year":"1999","unstructured":"Chen, Z. L., & Powell, W. B. (1999). A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. European Journal of Operational Research, 116(1), 220\u2013232. https:\/\/doi.org\/10.1016\/S0377-2217(98)00136-2","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"5883_CR10","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/S1553-7250(12)38073-2","volume":"38","author":"B Cohen","year":"2012","unstructured":"Cohen, B., Hyman, S., Rosenberg, L., et al. (2012). Frequency of patient contact with health care personnel and visitors: Implications for infection prevention. Joint Commission Journal on Quality and Patient Safety \/ Joint Commission Resources, 38(12), 560\u2013565. https:\/\/doi.org\/10.1016\/S1553-7250(12)38073-2","journal-title":"Joint Commission Journal on Quality and Patient Safety \/ Joint Commission Resources"},{"key":"5883_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120374","volume":"228","author":"Z Dai","year":"2023","unstructured":"Dai, Z., Zhang, Z., & Chen, M. (2023). The home health care location-routing problem with a mixed fleet and battery swapping stations using a competitive simulated annealing algorithm. Expert Systems with Applications, 228, 120374. https:\/\/doi.org\/10.1016\/j.eswa.2023.120374","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"5883_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80\u201391. https:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Management Science"},{"issue":"1","key":"5883_CR13","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10696-019-09350-x","volume":"33","author":"M Demirbilek","year":"2021","unstructured":"Demirbilek, M., Branke, J., & Strauss, A. K. (2021). Home healthcare routing and scheduling of multiple nurses in a dynamic environment. Flexible Services and Manufacturing Journal, 33(1), 253\u2013280. https:\/\/doi.org\/10.1007\/s10696-019-09350-x","journal-title":"Flexible Services and Manufacturing Journal"},{"issue":"2","key":"5883_CR14","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., & Solomon, M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2), 342\u2013354. https:\/\/doi.org\/10.1287\/opre.40.2.342","journal-title":"Operations Research"},{"issue":"4","key":"5883_CR15","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu, B., Vural, A. V., & Reisman, A. (2009). The vehicle routing problem: A taxonomic review. Computers & Industrial Engineering, 57(4), 1472\u20131483. https:\/\/doi.org\/10.1016\/j.cie.2009.05.009","journal-title":"Computers & Industrial Engineering"},{"key":"5883_CR16","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1016\/j.jclepro.2019.06.236","volume":"234","author":"M Erdem","year":"2019","unstructured":"Erdem, M., & Ko\u00e7, \u00c7. (2019). Analysis of electric vehicles in home health care routing problem. Journal of Cleaner Production, 234, 1471\u20131483. https:\/\/doi.org\/10.1016\/j.jclepro.2019.06.236","journal-title":"Journal of Cleaner Production"},{"key":"5883_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2019.118200","volume":"240","author":"AM Fathollahi-Fard","year":"2019","unstructured":"Fathollahi-Fard, A. M., Govindan, K., Hajiaghaei-Keshteli, M., et al. (2019). A green home health care supply chain: New modified simulated annealing algorithms. Journal of Cleaner Production, 240, 118200. https:\/\/doi.org\/10.1016\/j.jclepro.2019.118200","journal-title":"Journal of Cleaner Production"},{"key":"5883_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jii.2021.100246","volume":"25","author":"AM Fathollahi-Fard","year":"2022","unstructured":"Fathollahi-Fard, A. M., Hajiaghaei-Keshteli, M., Tavakkoli-Moghaddam, R., et al. (2022). Bi-level programming for home health care supply chain considering outsourcing. Journal of Industrial Information Integration, 25, 100246. https:\/\/doi.org\/10.1016\/j.jii.2021.100246","journal-title":"Journal of Industrial Information Integration"},{"issue":"2","key":"5883_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.cie.2009.02.012","volume":"58","author":"H Fei","year":"2010","unstructured":"Fei, H., Meskens, N., & Chu, C. (2010). A planning and scheduling problem for an operating theatre using an open scheduling strategy. Computers & Industrial Engineering, 58(2), 221\u2013230. https:\/\/doi.org\/10.1016\/j.cie.2009.02.012","journal-title":"Computers & Industrial Engineering"},{"key":"5883_CR20","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1025160705362","volume":"22","author":"C Giambruno","year":"1997","unstructured":"Giambruno, C., Cowell, C., Barber-Madden, R., et al. (1997). The extent of barriers and linkages to health care for head start children. Journal of Community Health, 22, 101\u2013114. https:\/\/doi.org\/10.1023\/A:1025160705362","journal-title":"Journal of Community Health"},{"issue":"1","key":"5883_CR21","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.ejor.2018.11.025","volume":"275","author":"F Grenouilleau","year":"2019","unstructured":"Grenouilleau, F., Legrain, A., Lahrichi, N., et al. (2019). A set partitioning heuristic for the home health care routing and scheduling problem. European Journal of Operational Research, 275(1), 295\u2013303. https:\/\/doi.org\/10.1016\/j.ejor.2018.11.025","journal-title":"European Journal of Operational Research"},{"key":"5883_CR22","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10878-020-00667-0","volume":"41","author":"MR Hassani","year":"2021","unstructured":"Hassani, M. R., & Behnamian, J. (2021). A scenario-based robust optimization with a pessimistic approach for nurse rostering problem. Journal of Combinatorial Optimization, 41, 143\u2013169. https:\/\/doi.org\/10.1007\/s10878-020-00667-0","journal-title":"Journal of Combinatorial Optimization"},{"key":"5883_CR23","unstructured":"Kergosien, Y., Lent\u00e9, C., & Billaut, J.C. (2009). Home health care problem: An extended multiple traveling salesman problem. In: Proceedings of the 4th multidisciplinary international scheduling conference: theory and applications (MISTA 2009), pp 85\u201392"},{"key":"5883_CR24","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10696-011-9121-4","volume":"24","author":"E Lanzarone","year":"2012","unstructured":"Lanzarone, E., & Matta, A. (2012). A cost assignment policy for home care patients. Flexible Services and Manufacturing Journal, 24, 465\u2013495. https:\/\/doi.org\/10.1007\/s10696-011-9121-4","journal-title":"Flexible Services and Manufacturing Journal"},{"issue":"4","key":"5883_CR25","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43(4), 408\u2013416. https:\/\/doi.org\/10.1287\/trsc.1090.0301","journal-title":"Transportation Science"},{"key":"5883_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2021.102420","volume":"152","author":"Y Li","year":"2021","unstructured":"Li, Y., Xiang, T., & Szeto, W. Y. (2021). Home health care routing and scheduling problem with the consideration of outpatient services. Transportation research Part E: Logistics and Transportation Review, 152, 102420. https:\/\/doi.org\/10.1016\/j.tre.2021.102420","journal-title":"Transportation research Part E: Logistics and Transportation Review"},{"key":"5883_CR27","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cie.2017.11.004","volume":"115","author":"CC Lin","year":"2018","unstructured":"Lin, C. C., Hung, L. P., Liu, W. Y., et al. (2018). Jointly rostering, routing, and rerostering for home health care services: A harmony search approach with genetic, saturation, inheritance, and immigrant schemes. Computers & Industrial Engineering, 115, 151\u2013166. https:\/\/doi.org\/10.1016\/j.cie.2017.11.004","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"5883_CR28","doi-asserted-by":"publisher","first-page":"4443","DOI":"10.1007\/s40314-018-0584-8","volume":"37","author":"M Liu","year":"2018","unstructured":"Liu, M., Yang, D., Su, Q., et al. (2018). Bi-objective approaches for home healthcare medical team planning and scheduling problem. Computational and Applied Mathematics, 37(4), 4443\u20134474. https:\/\/doi.org\/10.1007\/s40314-018-0584-8","journal-title":"Computational and Applied Mathematics"},{"key":"5883_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115307","volume":"183","author":"W Liu","year":"2021","unstructured":"Liu, W., Dridi, M., Fei, H., et al. (2021). Hybrid metaheuristics for solving a home health care routing and scheduling problem with time windows, synchronized visits and lunch breaks. Expert Systems with Applications, 183, 115307. https:\/\/doi.org\/10.1016\/j.eswa.2021.115307","journal-title":"Expert Systems with Applications"},{"key":"5883_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115307","volume":"162","author":"W Liu","year":"2021","unstructured":"Liu, W., Dridi, M., Fei, H., et al. (2021). Solving a multi-period home health care routing and scheduling problem using an efficient matheuristic. Computers & Industrial Engineering, 162, 107721. https:\/\/doi.org\/10.1016\/j.eswa.2021.115307","journal-title":"Computers & Industrial Engineering"},{"issue":"1\u20133","key":"5883_CR31","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PR \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P. R. (2002). A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, 120(1\u20133), 197\u2013207. https:\/\/doi.org\/10.1016\/S0166-218X(01)00290-6","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"5883_CR32","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"JY Potvin","year":"1993","unstructured":"Potvin, J. Y., & Rousseau, J. M. (1993). A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research, 66(3), 331\u2013340. https:\/\/doi.org\/10.1016\/0377-2217(93)90221-8","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"5883_CR33","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"JY Potvin","year":"1995","unstructured":"Potvin, J. Y., & Rousseau, J. M. (1995). An exchange heuristic for routeing problems with time windows. Journal of the Operational Research Society, 46(12), 1433\u20131446. https:\/\/doi.org\/10.1057\/jors.1995.204","journal-title":"Journal of the Operational Research Society"},{"issue":"8","key":"5883_CR34","first-page":"567","volume":"21","author":"KN Ray","year":"2015","unstructured":"Ray, K. N., Chari, A. V., Engberg, J., et al. (2015). Opportunity costs of ambulatory medical care in the united states. The American journal of managed care, 21(8), 567\u2013574.","journal-title":"The American journal of managed care"},{"issue":"1","key":"5883_CR35","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1109\/TASE.2018.2874392","volume":"16","author":"S Riazi","year":"2018","unstructured":"Riazi, S., Wigstr\u00f6m, O., Bengtsson, K., et al. (2018). A column generation-based gossip algorithm for home healthcare routing and scheduling problems. IEEE Transactions on Automation Science and Engineering, 16(1), 127\u2013137. https:\/\/doi.org\/10.1109\/TASE.2018.2874392","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"2","key":"5883_CR36","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1287\/trsc.29.2.156","volume":"29","author":"RA Russell","year":"1995","unstructured":"Russell, R. A. (1995). Hybrid heuristics for the vehicle routing problem with time windows. Transportation science, 29(2), 156\u2013166. https:\/\/doi.org\/10.1287\/trsc.29.2.156","journal-title":"Transportation science"},{"issue":"1","key":"5883_CR37","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"MW Savelsbergh","year":"1985","unstructured":"Savelsbergh, M. W. (1985). Local search in routing problems with time windows. Annals of Operations Research, 4(1), 285\u2013305. https:\/\/doi.org\/10.1007\/BF02022044","journal-title":"Annals of Operations Research"},{"issue":"2","key":"5883_CR38","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"MW Savelsbergh","year":"1992","unstructured":"Savelsbergh, M. W. (1992). The vehicle routing problem with time windows: Minimizing route duration. ORSA Journal on Computing, 4(2), 146\u2013154. https:\/\/doi.org\/10.1287\/ijoc.4.2.146","journal-title":"ORSA Journal on Computing"},{"key":"5883_CR39","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.tre.2019.05.015","volume":"128","author":"Y Shi","year":"2019","unstructured":"Shi, Y., Boudouh, T., & Grunder, O. (2019). A robust optimization for a home health care routing and scheduling problem with consideration of uncertain travel and service times. Transportation Research Part E: Logistics and Transportation Review, 128, 52\u201395. https:\/\/doi.org\/10.1016\/j.tre.2019.05.015","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"2","key":"5883_CR40","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254\u2013265. https:\/\/doi.org\/10.1287\/opre.35.2.254","journal-title":"Operations Research"},{"issue":"2","key":"5883_CR41","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/s10900-018-0572-3","volume":"44","author":"LE Starbird","year":"2019","unstructured":"Starbird, L. E., DiMaina, C., Sun, C. A., et al. (2019). A systematic review of interventions to minimize transportation barriers among people with chronic diseases. Journal of Community Health, 44(2), 400\u2013411. https:\/\/doi.org\/10.1007\/s10900-018-0572-3","journal-title":"Journal of Community Health"},{"key":"5883_CR42","doi-asserted-by":"publisher","first-page":"1871","DOI":"10.1111\/j.1475-6773.2006.00689.x","volume":"42","author":"M Tai-Seale","year":"2007","unstructured":"Tai-Seale, M., McGuire, T. G., & Zhang, W. (2007). Time allocation in primary care office visits. Health Services Research, 42, 1871\u20131894. https:\/\/doi.org\/10.1111\/j.1475-6773.2006.00689.x","journal-title":"Health Services Research"},{"issue":"2","key":"5883_CR43","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9 Taillard","year":"1997","unstructured":"Taillard, \u00c9., Badeau, P., Gendreau, M., et al. (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 31(2), 170\u2013186. https:\/\/doi.org\/10.1287\/trsc.31.2.170","journal-title":"Transportation Science"},{"key":"5883_CR44","first-page":"124","volume":"3","author":"A Trautsamwieser","year":"2011","unstructured":"Trautsamwieser, A., & Hirsch, P. (2011). Optimization of daily scheduling for home health care services. JAOR, 3, 124\u2013136.","journal-title":"JAOR"},{"key":"5883_CR45","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01300970","volume":"3","author":"PH Vance","year":"1994","unstructured":"Vance, P. H., Barnhart, C., Johnson, E. L., et al. (1994). Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications, 3, 111\u2013130. https:\/\/doi.org\/10.1007\/BF01300970","journal-title":"Computational Optimization and Applications"},{"issue":"6","key":"5883_CR46","doi-asserted-by":"publisher","first-page":"815","DOI":"10.2105\/AJPH.2020.305579","volume":"110","author":"MK Wolfe","year":"2020","unstructured":"Wolfe, M. K., McDonald, N. C., & Holmes, G. M. (2020). Transportation barriers to health care in the united states: Findings from the national health interview survey, 1997\u20132017. American Journal of Public Health, 110(6), 815\u2013822.","journal-title":"American Journal of Public Health"},{"issue":"3","key":"5883_CR47","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1016\/j.ejor.2022.03.022","volume":"303","author":"N Yadav","year":"2022","unstructured":"Yadav, N., & Tanksale, A. (2022). An integrated routing and scheduling problem for home healthcare delivery with limited person-to-person contact. European Journal of Operational Research, 303(3), 1100\u20131125. https:\/\/doi.org\/10.1016\/j.ejor.2022.03.022","journal-title":"European Journal of Operational Research"},{"key":"5883_CR48","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2016.02.011","volume":"73","author":"S Yal\u00e7\u0131nda\u011f","year":"2016","unstructured":"Yal\u00e7\u0131nda\u011f, S., Cappanera, P., Scutell\u00e0, M. G., et al. (2016). Pattern-based decompositions for human resource planning in home health care services. Computers & Operations Research, 73, 12\u201326. https:\/\/doi.org\/10.1016\/j.cor.2016.02.011","journal-title":"Computers & Operations Research"},{"key":"5883_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2021.102391","volume":"152","author":"Y Yuan","year":"2021","unstructured":"Yuan, Y., Cattaruzza, D., Ogier, M., et al. (2021). A column generation based heuristic for the generalized vehicle routing problem with time windows. Transportation Research Part E: Logistics and Transportation Review, 152, 102391. https:\/\/doi.org\/10.1016\/j.tre.2021.102391","journal-title":"Transportation Research Part E: Logistics and Transportation Review"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-05883-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-05883-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-05883-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T15:49:55Z","timestamp":1729007395000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-05883-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,5]]},"references-count":49,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["5883"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-05883-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,5]]},"assertion":[{"value":"7 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}