{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:53:30Z","timestamp":1773842010558,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319597751","type":"print"},{"value":"9783319597768","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59776-8_20","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:26:33Z","timestamp":1496136393000},"page":"244-253","source":"Crossref","is-referenced-by-count":4,"title":["Minimum Makespan Vehicle Routing Problem with Compatibility Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7625-6315","authenticated-orcid":false,"given":"Miao","family":"Yu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9514-5581","authenticated-orcid":false,"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2854-163X","authenticated-orcid":false,"given":"Siqian","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.37.2.153.15243","volume":"37","author":"NR Achuthan","year":"2003","unstructured":"Achuthan, N.R., Caccetta, L., Hill, S.P.: An improved branch-and-cut algorithm for the capacitated vehicle routing problem. Transp. Sci. 37(2), 153\u2013169 (2003)","journal-title":"Transp. Sci."},{"key":"20_CR2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1993)"},{"issue":"2","key":"20_CR3","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1287\/ijoc.14.2.132.118","volume":"14","author":"D Applegate","year":"2002","unstructured":"Applegate, D., Cook, W., Dash, S., Rohe, A.: Solution of a min-max vehicle routing problem. INFORMS J. Comput. 14(2), 132\u2013143 (2002)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"20_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jalgor.2005.01.007","volume":"59","author":"EM Arkin","year":"2006","unstructured":"Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59(1), 1\u201318 (2006)","journal-title":"J. Algorithms"},{"issue":"5","key":"20_CR5","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5), 1269\u20131283 (2011)","journal-title":"Oper. Res."},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-27821-4_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C Chekuri","year":"2004","unstructured":"Chekuri, C., Kumar, A.: Maximum coverage problem with group budget constraints and applications. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX\/RANDOM 2004. LNCS, vol. 3122, pp. 72\u201383. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-27821-4_7"},{"issue":"1","key":"20_CR7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"issue":"4","key":"20_CR8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.orl.2003.11.010","volume":"32","author":"G Even","year":"2004","unstructured":"Even, G., Garg, N., K\u00f6nemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Oper. Res. Lett. 32(4), 309\u2013315 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"20_CR9","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10288-010-0130-z","volume":"8","author":"D Feillet","year":"2010","unstructured":"Feillet, D.: A tutorial on column generation and branch-and-price for vehicle routing problems. Q. J. Oper. Res. 8(4), 407\u2013424 (2010)","journal-title":"Q. J. Oper. Res."},{"issue":"3","key":"20_CR10","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3), 216\u2013229 (2004)","journal-title":"Networks"},{"key":"20_CR11","unstructured":"National Association for Home Care & Hospice. Basic Statistics About Home Care, pp. 1\u201314. National Association for Home Care & Hospice, Washington, DC (2010)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. In: 17th Annual Symposium on Foundations of Computer Science, pp. 216\u2013227. IEEE (1976)","DOI":"10.1109\/SFCS.1976.6"},{"issue":"3","key":"20_CR13","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R Fukasawa","year":"2006","unstructured":"Fukasawa, R., Longo, H., Lysgaard, J., de Arag\u00e3o, M.P., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106(3), 491\u2013511 (2006)","journal-title":"Math. Program."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Garg, N.: A 3-approximation for the minimum tree spanning \n            $$k$$\n           vertices. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS 1996, pp. 302\u2013309. IEEE Computer Society, Washington, DC (1996)","DOI":"10.1109\/SFCS.1996.548489"},{"key":"20_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77778-8","volume-title":"Problem, The Vehicle Routing: Latest Advances and New Challenges","author":"BL Golden","year":"2008","unstructured":"Golden, B.L., Raghavan, S., Wasil, E.A.: Problem, The Vehicle Routing: Latest Advances and New Challenges. Springer Science & Business Media, New York (2008)"},{"key":"20_CR16","unstructured":"Gurobi Optimization, Inc., Gurobi optimizer reference manual (2016). \nhttp:\/\/www.gurobi.com"},{"issue":"2","key":"20_CR17","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M Jepsen","year":"2008","unstructured":"Jepsen, M., Petersen, B., Spoorendonk, S., Pisinger, D.: Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2), 497\u2013511 (2008)","journal-title":"Oper. Res."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Kallehauge, B., Larsen, J., Madsen, O.B., Solomon, M.M.: Vehicle routing problem with time windows. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, pp. 67\u201398. Springer, New York (2005)","DOI":"10.1007\/0-387-25486-2_3"},{"issue":"1","key":"20_CR19","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-002-0336-8","volume":"94","author":"AN Letchford","year":"2002","unstructured":"Letchford, A.N., Eglese, R.W., Lysgaard, J.: Multistars, partial multistars and the capacitated vehicle routing problem. Math. Program. 94(1), 21\u201340 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"20_CR20","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2), 423\u2013445 (2004)","journal-title":"Math. Program."},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-319-07557-0_33","volume-title":"Integer Programming and Combinatorial Optimization","author":"D Pecin","year":"2014","unstructured":"Pecin, D., Pessoa, A., Poggi, M., Uchoa, E.: Improved branch-cut-and-price for capacitated vehicle routing. In: Lee, J., Vygen, J. (eds.) IPCO 2014. LNCS, vol. 8494, pp. 393\u2013403. Springer, Cham (2014). doi:\n10.1007\/978-3-319-07557-0_33"},{"issue":"2\u20133","key":"20_CR22","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"TK Ralphs","year":"2003","unstructured":"Ralphs, T.K., Kopman, L., Pulleyblank, W.R., Trotter, L.E.: On the capacitated vehicle routing problem. Math. Program. 94(2\u20133), 343\u2013359 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"20_CR23","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"20_CR24","volume-title":"Problems, Methods, and Applications","author":"P Toth","year":"2014","unstructured":"Toth, P., Vigo, D., Routing, V.: Problems, Methods, and Applications. SIAM, Philadelphia (2014)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:35:56Z","timestamp":1496136956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}