{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:41:57Z","timestamp":1725856917035},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319334608"},{"type":"electronic","value":"9783319334615"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-33461-5_8","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T22:35:59Z","timestamp":1464129359000},"page":"89-101","source":"Crossref","is-referenced-by-count":1,"title":["Exact Algorithms for the Chance-Constrained Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Thai","family":"Dinh","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Fukasawa","sequence":"additional","affiliation":[]},{"given":"James","family":"Luedtke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,25]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"crossref","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":"8_CR2","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."},{"issue":"3","key":"8_CR3","doi-asserted-by":"crossref","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":"6","key":"8_CR4","doi-asserted-by":"crossref","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":"8_CR5","doi-asserted-by":"crossref","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":"8_CR6","doi-asserted-by":"crossref","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":"8_CR7","doi-asserted-by":"crossref","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":"8_CR8","first-page":"80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Man. Sci. 6(1), 80\u201391 (1959)","journal-title":"The truck dispatching problem. Man. Sci."},{"issue":"3","key":"8_CR9","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. Zeitschrift f\u00fcr Oper. Res. 37(3), 273\u2013283 (1993)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"issue":"3","key":"8_CR10","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":"8_CR11","doi-asserted-by":"crossref","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."},{"key":"8_CR12","volume-title":"Column Generation","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 Generation. Springer, New York (2005)"},{"issue":"1","key":"8_CR13","doi-asserted-by":"crossref","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. European J. Oper. Res. 39(1), 71\u201378 (1989)","journal-title":"European J. Oper. Res."},{"issue":"3","key":"8_CR14","doi-asserted-by":"crossref","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":"8_CR15","doi-asserted-by":"crossref","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":"8_CR16","doi-asserted-by":"crossref","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":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, Heidelberg (2014)"},{"issue":"1","key":"8_CR18","doi-asserted-by":"crossref","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."},{"issue":"4","key":"8_CR19","doi-asserted-by":"crossref","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(4), 735\u2013747 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"8_CR20","doi-asserted-by":"crossref","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. Euro. J. Oper. Res. 14(4), 371\u2013385 (1983)","journal-title":"Euro. J. Oper. Res."},{"issue":"1","key":"8_CR21","doi-asserted-by":"crossref","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."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33461-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:51:57Z","timestamp":1498315917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33461-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319334608","9783319334615"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33461-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}