{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T09:50:26Z","timestamp":1785750626087,"version":"3.56.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,5,3]],"date-time":"2017-05-03T00:00:00Z","timestamp":1493769600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,5,3]],"date-time":"2017-05-03T00:00:00Z","timestamp":1493769600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-05623"],"award-info":[{"award-number":["RGPIN-05623"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-0952907"],"award-info":[{"award-number":["CMMI-0952907"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1130266"],"award-info":[{"award-number":["CMMI-1130266"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-15-1-2268"],"award-info":[{"award-number":["N00014-15-1-2268"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10107-017-1151-6","type":"journal-article","created":{"date-parts":[[2017,5,3]],"date-time":"2017-05-03T07:29:52Z","timestamp":1493796592000},"page":"105-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["Exact algorithms for the chance-constrained vehicle routing problem"],"prefix":"10.1007","volume":"172","author":[{"given":"Thai","family":"Dinh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ricardo","family":"Fukasawa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Luedtke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,5,3]]},"reference":[{"issue":"2","key":"1151_CR1","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10107-008-0218-9","volume":"120","author":"R Baldacci","year":"2009","unstructured":"Baldacci, R., Mingozzi, A.: A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120(2), 347\u2013380 (2009)","journal-title":"Math. Program."},{"issue":"5","key":"1151_CR2","doi-asserted-by":"publisher","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":"1151_CR3","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.ejor.2014.07.023","volume":"240","author":"P Beraldi","year":"2015","unstructured":"Beraldi, P., Bruni, M.E., Lagan\u00e0, D., Musmanno, R.: The mixed capacitated general routing problem under uncertainty. Eur. J. Oper. Res. 240, 382\u2013392 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1151_CR4","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1287\/opre.40.3.574","volume":"40","author":"DJ Bertsimas","year":"1992","unstructured":"Bertsimas, D.J.: A vehicle routing problem with stochastic demand. Oper. Res. 40(3), 574\u2013585 (1992)","journal-title":"Oper. Res."},{"issue":"1","key":"1151_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-006-9084-x","volume":"130","author":"GC Calafiore","year":"2006","unstructured":"Calafiore, G.C., El Ghaoui, L.: On distributionally robust chance-constrained linear programs. J. Optim. Theory Appl. 130(1), 1\u201322 (2006)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1151_CR6","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/opre.1090.0712","volume":"58","author":"W Chen","year":"2010","unstructured":"Chen, W., Sim, M., Sun, J., Teo, C.P.: From CVaR to uncertainty set: implications in joint chance-constrained optimization. Oper. Res. 58(2), 470\u2013485 (2010)","journal-title":"Oper. Res."},{"issue":"3","key":"1151_CR7","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1137\/130915315","volume":"24","author":"J Cheng","year":"2014","unstructured":"Cheng, J., Delage, E., Lisser, A.: Distributionally robust stochastic knapsack problem. SIAM J. Optim. 24(3), 1485\u20131506 (2014)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1151_CR8","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.orl.2009.05.008","volume":"37","author":"CH Christiansen","year":"2009","unstructured":"Christiansen, C.H., Lysgaard, J., W\u00f8hlk, S.: A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands. Oper. Res. Lett. 37(6), 392\u2013398 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1151_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20(1), 255\u2013282 (1981)","journal-title":"Math. Program."},{"issue":"4","key":"1151_CR10","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"1151_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo, C., Martinelli, R.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discr. Optim. 12, 129\u2013146 (2014)","journal-title":"Discr. Optim."},{"issue":"1","key":"1151_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.: The truck dispatching problem. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"issue":"3","key":"1151_CR13","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/opre.1090.0741","volume":"58","author":"E Delage","year":"2010","unstructured":"Delage, E., Ye, Y.: Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3), 595\u2013612 (2010)","journal-title":"Oper. Res."},{"key":"1151_CR14","volume-title":"Integer Programming and Combintatorial Optimization","author":"T Dinh","year":"2016","unstructured":"Dinh, T., Fukasawa, R., Luedtke, J.: Exact algorithms for the chance-constrained vehicle routing problem. In: Louveaux, Q., Skutella, M. (eds.) Integer Programming and Combintatorial Optimization. Springer, Berlin (2016)"},{"issue":"2","key":"1151_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"3","key":"1151_CR16","first-page":"273","volume":"37","author":"M Dror","year":"1993","unstructured":"Dror, M., Laporte, G., Louveaux, F.V.: Vehicle routing with stochastic demands and restricted failures. Z. Oper. Res. 37(3), 273\u2013283 (1993)","journal-title":"Z. Oper. Res."},{"issue":"4","key":"1151_CR17","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1287\/opre.51.4.543.16101","volume":"51","author":"L El Ghaoui","year":"2003","unstructured":"El Ghaoui, L., Oks, M., Oustry, F.: Worst-case value-at-risk and robust portfolio optimization: a conic programming approach. Oper. Res. 51(4), 543\u2013556 (2003)","journal-title":"Oper. Res."},{"issue":"1","key":"1151_CR18","first-page":"37","volume":"107","author":"E Erdo\u011fan","year":"2005","unstructured":"Erdo\u011fan, E., Iyengar, G.: Ambiguous chance constrained problems and robust optimization. Math. Program. 107(1), 37\u201361 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"1151_CR19","doi-asserted-by":"publisher","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":"1151_CR20","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.cor.2014.03.028","volume":"50","author":"C Gauvin","year":"2014","unstructured":"Gauvin, C., Desaulniers, G., Gendreau, M.: A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 50, 141\u2013153 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1151_CR21","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1287\/opre.1120.1136","volume":"61","author":"CE Gounaris","year":"2013","unstructured":"Gounaris, C.E., Wiesemann, W., Floudas, C.A.: The robust capacitated vehicle routing problem under demand uncertainty. Oper. Res. 61(3), 677\u2013693 (2013)","journal-title":"Oper. Res."},{"issue":"1","key":"1151_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10107-015-0896-z","volume":"151","author":"GA Hanasusanto","year":"2015","unstructured":"Hanasusanto, G.A., Roitch, V., Kuhn, D., Wiesemann, W.: A distributionally robust perspective on uncertainty quantification and chance constrained programming. Math. Program. 151(1), 35\u201362 (2015)","journal-title":"Math. Program."},{"key":"1151_CR23","volume-title":"Column Gener.","author":"S Irnich","year":"2005","unstructured":"Irnich, S., Desaulniers, G.: Shortest path problems with resource constraints. In: Desaulniers, G., Desrosiers, J., Solomon, M. (eds.) Column Gener. Springer, Berlin (2005)"},{"key":"1151_CR24","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10107-015-0929-7","volume":"58","author":"R Jiang","year":"2016","unstructured":"Jiang, R., Guan, Y.: Data-driven chance constrained stochastic program. Math. Program. 58, 291\u2013327 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"1151_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0377-2217(89)90354-8","volume":"39","author":"G Laporte","year":"1989","unstructured":"Laporte, G., Louveaux, F., Mercure, H.: Models and exact solutions for a class of stochastic location-routing problems. Eur. J. Oper. Res. 39(1), 71\u201378 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1151_CR26","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/trsc.26.3.161","volume":"26","author":"G Laporte","year":"1992","unstructured":"Laporte, G., Louveaux, F., Mercure, H.: The vehicle routing problem with stochastic travel times. Trans. Sci. 26(3), 161\u2013170 (1992)","journal-title":"Trans. Sci."},{"issue":"3","key":"1151_CR27","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/opre.50.3.415.7751","volume":"50","author":"G Laporte","year":"2002","unstructured":"Laporte, G., Louveaux, F.V., Van Hamme, L.: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. 50(3), 415\u2013423 (2002)","journal-title":"Oper. Res."},{"key":"1151_CR28","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/070702928","volume":"19","author":"J Luedtke","year":"2008","unstructured":"Luedtke, J., Ahmed, S.: A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19, 674\u2013699 (2008)","journal-title":"SIAM J. Optim."},{"key":"1151_CR29","doi-asserted-by":"crossref","unstructured":"Pecin, D., Pessoa, A., Poggi, M., Uchoa, E.: Improved branch-cut-and-price for capacitated vehicle routing. In: Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 8494, pp. 393\u2013403. Springer (2014)","DOI":"10.1007\/978-3-319-07557-0_33"},{"key":"1151_CR30","unstructured":"Pessoa, A.A., Pugliese, L.D.P., Guerriero, F., Poss, M.: Robust constrained shortest path problems under budgeted uncertainty. \n                    http:\/\/www.optimization-online.org\/DB_FILE\/2014\/10\/4601.pdf\n                    \n                   (2014)"},{"issue":"1","key":"1151_CR31","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1287\/opre.1080.0520","volume":"57","author":"N Secomandi","year":"2009","unstructured":"Secomandi, N., Margot, F.: Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. 57(1), 214\u2013230 (2009)","journal-title":"Oper. Res."},{"key":"1151_CR32","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1287\/ijoc.2014.0595","volume":"26","author":"Y Song","year":"2014","unstructured":"Song, Y., Luedtke, J.R., K\u00fc\u00e7\u00fckyavuz, S.: Chance-constrained binary packing problems. INFORMS J. Comput. 26, 735\u2013747 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"1151_CR33","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0377-2217(83)90237-0","volume":"14","author":"WR Stewart","year":"1983","unstructured":"Stewart, W.R., Golden, B.L.: Stochastic vehicle routing: a comprehensive approach. Eur. J. Oper. Res. 14(4), 371\u2013385 (1983)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20134","key":"1151_CR34","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1151_CR35","first-page":"231","volume":"155","author":"W Yang","year":"2014","unstructured":"Yang, W., Xu, H.: Distributionally robust chance constraints for non-linear uncertainties. Math. Program. 155(1), 231\u2013265 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"1151_CR36","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/trsc.34.1.99.12278","volume":"34","author":"WH Yang","year":"2000","unstructured":"Yang, W.H., Mathur, K., Ballou, R.H.: Stochastic vehicle routing problem with restocking. Trans. Sci. 34(1), 99\u2013112 (2000)","journal-title":"Trans. Sci."},{"key":"1151_CR37","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10107-011-0494-7","volume":"137","author":"S Zymler","year":"2011","unstructured":"Zymler, S., Kuhn, D., Rustem, B.: Distributionally robust joint chance constraints with second-order moment information. Math. Program. 137, 167\u2013198 (2011)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1151-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1151-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1151-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:23:17Z","timestamp":1589646197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1151-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,3]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1151"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1151-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,3]]},"assertion":[{"value":"13 May 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}