{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:25:40Z","timestamp":1766136340422},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315930"},{"type":"electronic","value":"9783642315947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_35","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T17:20:21Z","timestamp":1340385621000},"page":"411-423","source":"Crossref","is-referenced-by-count":4,"title":["Stochastic Vehicle Routing with Recourse"],"prefix":"10.1007","author":[{"given":"Inge Li","family":"G\u00f8rtz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rishi","family":"Saket","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"35_CR1","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1287\/trsc.1060.0180","volume":"41","author":"A. Ak","year":"2007","unstructured":"Ak, A., Erera, A.L.: A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands. Transportation Science\u00a041(2), 222\u2013237 (2007)","journal-title":"Transportation Science"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6377(87)90012-5","volume":"6","author":"K. Altinkemer","year":"1987","unstructured":"Altinkemer, K., Gavish, B.: Heuristics for unequal weight delivery problems with a fixed error guarantee. Operations Research Letters\u00a06, 149\u2013158 (1987)","journal-title":"Operations Research Letters"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-14165-2_22","volume-title":"Automata, Languages and Programming","author":"N. Bansal","year":"2010","unstructured":"Bansal, N., Khot, S.: Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part I. LNCS, vol.\u00a06198, pp. 250\u2013261. Springer, Heidelberg (2010)"},{"issue":"3","key":"35_CR4","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1287\/opre.40.3.574","volume":"40","author":"D.J. Bertsimas","year":"1992","unstructured":"Bertsimas, D.J.: A vehicle routing problem with stochastic demand. Operations Research\u00a040(3), 574\u2013585 (1992)","journal-title":"Operations Research"},{"issue":"6","key":"35_CR5","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1287\/opre.38.6.1019","volume":"38","author":"D.J. Bertsimas","year":"1990","unstructured":"Bertsimas, D.J., Jaillet, P., Odoni, A.R.: A priori optimization. Operations Research\u00a038(6), 1019\u20131033 (1990)","journal-title":"Operations Research"},{"key":"35_CR6","volume-title":"Introduction to Stochastic Programming","author":"J.R. Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (1997)"},{"issue":"3","key":"35_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10878-005-1412-9","volume":"9","author":"G. Calinescu","year":"2005","unstructured":"Calinescu, G., Zelikovsky, A.: The polymatroid steiner problems. Journal of Combinatorial Optimization\u00a09(3), 281\u2013294 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"35_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.1070.0203","volume":"42","author":"A.M. Campbell","year":"2008","unstructured":"Campbell, A.M., Thomas, B.W.: Probabilistic traveling salesman problem with deadlines. Transportation Science\u00a042(1), 1\u201321 (2008)","journal-title":"Transportation Science"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S.: Rounding via trees: Deterministic approximation algorithms for group steiner trees and k-median. In: Proc. STOC 1988, pp. 114\u2013123 (1998)","DOI":"10.1145\/276698.276719"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11538462_22","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"M. Charikar","year":"2005","unstructured":"Charikar, M., Chekuri, C., P\u00e1l, M.: Sampling Bounds for Stochastic Optimization. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 257\u2013269. Springer, Heidelberg (2005)"},{"issue":"1","key":"35_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2005.07.010","volume":"154","author":"C. Chekuri","year":"2006","unstructured":"Chekuri, C., Even, G., Kortsarz, G.: A greedy approximation algorithm for the group steiner problem. Discrete Applied Mathematics\u00a0154(1), 15\u201334 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR12","unstructured":"Chekuri, C., P\u00e1l, M.: A recursive greedy algorithm for walks in directed graphs. In: Proc. FOCS, pp. 245\u2013253 (2005)"},{"issue":"4","key":"35_CR13","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1287\/moor.1080.0330","volume":"33","author":"B.C. Dean","year":"2008","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Approximating the stochastic knapsack problem: The benefit of adaptivity. Math. Oper. Res.\u00a033(4), 945\u2013964 (2008)","journal-title":"Math. Oper. Res."},{"key":"35_CR14","series-title":"International Series In Operations Research & Management Science","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/0-306-48102-2_25","volume-title":"Modeling Uncertainty","author":"M. Dror","year":"2005","unstructured":"Dror, M.: Vehicle Routing with Stochastic Demands: Models & Computational Methods. In: Modeling Uncertainty. International Series In Operations Research & Management Science, vol.\u00a046(8), pp. 625\u2013649. Springer, Heidelberg (2005)"},{"issue":"4","key":"35_CR15","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1002\/net.20338","volume":"54","author":"A.L. Erera","year":"2009","unstructured":"Erera, A.L., Savelsbergh, M.W.P., Uyar, E.: Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. Networks\u00a054(4), 270\u2013283 (2009)","journal-title":"Networks"},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N. Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. Journal of Algorithms\u00a037(1), 66\u201384 (2000)","journal-title":"Journal of Algorithms"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"G\u00f8rtz, I.L., Nagarajan, V., Saket, R.: Stochastic vehicle routing with recourse. CoRR, abs\/1202.5797 (2012)","DOI":"10.1007\/978-3-642-31594-7_35"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krishnaswamy, R., Nagarajan, V., Ravi, R.: Approximation Algorithms for Stochastic Orienteering. In: Proc. SODA 2012, pp. 245\u2013253 (2012)","DOI":"10.1137\/1.9781611973099.121"},{"issue":"1","key":"35_CR19","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1287\/opre.1110.0967","volume":"60","author":"A. Gupta","year":"2012","unstructured":"Gupta, A., Nagarajan, V., Ravi, R.: Approximation Algorithms for VRP with Stochastic Demands. Operations Research\u00a060(1), 123\u2013127 (2012)","journal-title":"Operations Research"},{"issue":"5","key":"35_CR20","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1137\/080732250","volume":"40","author":"A. Gupta","year":"2011","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Sampling and cost-sharing: Approximation algorithms for stochastic optimization problems. SIAM J. Comput.\u00a040(5), 1361\u20131401 (2011)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"35_CR21","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M. Haimovich","year":"1985","unstructured":"Haimovich, M., Rinnooy Kan, A.H.G.: Bounds and heuristics for capacitated routing problems. Mathematics of Operations Research\u00a010(4), 527\u2013542 (1985)","journal-title":"Mathematics of Operations Research"},{"key":"35_CR22","unstructured":"Immorlica, N., Karger, D.R., Minkoff, M., Mirrokni, V.S.: On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. In: Proc. SODA 2004, pp. 691\u2013700 (2004)"},{"issue":"2-3","key":"35_CR23","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2008.08.010","volume":"408","author":"I. Katriel","year":"2008","unstructured":"Katriel, I., Mathieu, C.K., Upfal, E.: Commitment under uncertainty: Two-stage stochastic matching problems. Theor. Comput. Sci.\u00a0408(2-3), 213\u2013223 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"35_CR24","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. STOC 2002, pp. 767\u2013775 (2002)","DOI":"10.1145\/510014.510017"},{"issue":"3","key":"35_CR25","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1002\/rsa.10038","volume":"20","author":"G. Konjevod","year":"2002","unstructured":"Konjevod, G., Ravi, R., Srinivasan, A.: Approximation algorithms for the covering steiner problem. Random Struct. Algorithms\u00a020(3), 465\u2013482 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"35_CR26","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046, 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"issue":"1","key":"35_CR27","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10107-005-0673-5","volume":"108","author":"R. Ravi","year":"2006","unstructured":"Ravi, R., Sinha, A.: Hedging uncertainty: Approximation algorithms for stochastic optimization problems. Math. Program.\u00a0108(1), 97\u2013114 (2006)","journal-title":"Math. Program."},{"key":"35_CR28","first-page":"163","volume":"16","author":"M.W.P. Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W.P., Goetschalkx, M.: A comparison of the efficiency of fixed versus variable vehicle routes. J. Business Logistics\u00a016, 163\u2013187 (1995)","journal-title":"J. Business Logistics"},{"key":"35_CR29","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization: polyhedra and efficiency. Springer, Berlin (2003)"},{"key":"35_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-68891-4_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"D.B. Shmoys","year":"2008","unstructured":"Shmoys, D.B., Talwar, K.: A Constant Approximation Algorithm for the a priori Traveling Salesman Problem. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 331\u2013343. Springer, Heidelberg (2008)"},{"key":"35_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-72792-7_12","volume-title":"Integer Programming and Combinatorial Optimization","author":"D.B. Shmoys","year":"2007","unstructured":"Shmoys, D.B., Sozio, M.: Approximation Algorithms for 2-Stage Stochastic Scheduling Problems. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 145\u2013157. Springer, Heidelberg (2007)"},{"issue":"6","key":"35_CR32","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1145\/1217856.1217860","volume":"53","author":"D.B. Shmoys","year":"2006","unstructured":"Shmoys, D.B., Swamy, C.: An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM\u00a053(6), 978\u20131012 (2006)","journal-title":"J. ACM"},{"key":"35_CR33","unstructured":"Srinivasan, A.: New approaches to covering and packing problems. In: Proc. SODA 2001, pp. 567\u2013576 (2001)"},{"key":"35_CR34","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0377-2217(83)90237-0","volume":"14","author":"W. Stewart","year":"1983","unstructured":"Stewart, W., Golden, B.: Stochastic vehicle routing: A comprehensive approach. Eur. Jour. Oper. Res.\u00a014, 371\u2013385 (1983)","journal-title":"Eur. Jour. Oper. Res."},{"key":"35_CR35","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The vehicle routing problem. Society for Industrial and Applied Mathematics (2001)","DOI":"10.1137\/1.9780898718515"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31594-7_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:15:01Z","timestamp":1620116101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}