{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:44:14Z","timestamp":1775328254523,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1023\/a:1021814225969","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T18:56:02Z","timestamp":1048272962000},"page":"289-333","source":"Crossref","is-referenced-by-count":362,"title":["The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study"],"prefix":"10.1007","volume":"24","author":[{"given":"Bram","family":"Verweij","sequence":"first","affiliation":[]},{"given":"Shabbir","family":"Ahmed","sequence":"additional","affiliation":[]},{"given":"Anton J.","family":"Kleywegt","sequence":"additional","affiliation":[]},{"given":"George","family":"Nemhauser","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Shapiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5113431_CR1","first-page":"178","volume-title":"Stochastics in Combinatorial Optimization","author":"G. Andreatta","year":"1987","unstructured":"G. Andreatta, \u201cShortest path models in stochastic networks,\u201d in Stochastics in Combinatorial Optimization, G. Andreatta, F. Mason, and P. Serafini (Eds.), CISM Udine, World Scientific Publishing: Singapore, 1987, pp. 178-186."},{"key":"5113431_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/net.3230180306","volume":"18","author":"G. Andreatta","year":"1988","unstructured":"G. Andreatta and L. Romeo, \u201cStochastic shortest paths with recourse,\u201d Networks, vol. 18, pp. 193-204, 1988.","journal-title":"Networks"},{"key":"5113431_CR3","doi-asserted-by":"crossref","unstructured":"D. Applegate, R. Bixby, V. Chv\u00e1tal, and W. Cook, \u201cOn the solution of traveling salesman problems,\u201d Documenta Mathematica, extra volume ICM 1998 III, pp. 645-656, 1998.","DOI":"10.4171\/dms\/1-3\/62"},{"key":"5113431_CR4","volume-title":"Introduction to Stochastic Programming","author":"J.B. Birge","year":"1997","unstructured":"J.B. Birge and F.V. Louveaux, Introduction to Stochastic Programming, Springer-Verlag: Berlin, 1997."},{"key":"5113431_CR5","volume-title":"Numerical Techniques for Stochastic Optimization","year":"1988","unstructured":"Y. Ermoliev and R.J.-B. Wets (Eds.), Numerical Techniques for Stochastic Optimization, Springer-Verlag: Berlin, 1988."},{"key":"5113431_CR6","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, W.H. Freeman and Company: New York, 1979."},{"key":"5113431_CR7","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1287\/opre.21.1.112","volume":"21","author":"S. Garstka","year":"1973","unstructured":"S. Garstka and D. Rutenberg, \u201cComputation in discrete stochastic programming with recourse,\u201d Operations Research, vol. 21, pp. 112-122, 1973.","journal-title":"Operations Research"},{"key":"5113431_CR8","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1111\/j.2517-6161.1992.tb01443.x","volume":"54","author":"C. G. eyer","year":"1992","unstructured":"C.J. G eyer and E.A. Thompson, \u201cConstrained Monte Carlo maximum likelihood for dependent data (with discussion),\u201d Journal of the Royal Statistical Society Series B, vol. 54, pp. 657-699, 1992.","journal-title":"Journal of the Royal Statistical Society Series B"},{"key":"5113431_CR9","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"R.E. Gomory and T.C. Hu, \u201cMulti-terminal network flows,\u201d SIAM Journal on Applied Mathematics, vol. 9, pp. 551-570, 1961.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"5113431_CR10","unstructured":"J. Hao and J.B. Orlin, \u201cA faster algorithm for finding the minimum cut in a graph,\u201d in Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 165-174."},{"key":"5113431_CR11","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1287\/moor.16.3.650","volume":"16","author":"J.L. Higle","year":"1991","unstructured":"J.L. Higle and S. Sen, \u201cStochastic decomposition: An algorithm for two stage stochastic linear programs with recourse,\u201d Mathematics of Operations Research, vol. 16, pp. 650-669, 1991.","journal-title":"Mathematics of Operations Research"},{"key":"5113431_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4115-8","volume-title":"Stochastic Decomposition","author":"J.L. Higle","year":"1996","unstructured":"J.L. Higle and S. Sen, Stochastic Decomposition, Kluwer Academic Publishers: Dordrecht, The Netherlands, 1996."},{"key":"5113431_CR13","unstructured":"ILOG, Inc., CPLEX Division, Incline Village, Nevada, CPLEX, a division of ILOG, 2001."},{"key":"5113431_CR14","volume-title":"Planning Under Uncertainty: Solving Large Scale Stochastic Linear Programs","author":"G. Infanger","year":"1994","unstructured":"G. Infanger, Planning Under Uncertainty: Solving Large Scale Stochastic Linear Programs, Boyd and Fraser: Denvers, MA, 1994."},{"key":"5113431_CR15","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"D.S. Johnson","year":"1997","unstructured":"D.S. Johnson and L.A. McGeoch, \u201cThe traveling salesman problem: A case study,\u201d in Local Search in Combinatorial Optimization, E. Aarts and J.K. Lenstra (Eds.), John Wiley &; Sons: Chichester, 1997, pp. 215-310."},{"key":"5113431_CR16","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"A.J. Kleywegt","year":"2001","unstructured":"A.J. Kleywegt, A. Shapiro, and T. Homem-de-Mello, \u201cThe sample average approximation method for stochastic discrete optimization,\u201d SIAM Journal on Optimization, vol. 12, pp. 479-502, 2001.","journal-title":"SIAM Journal on Optimization"},{"key":"5113431_CR17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G. Laporte","year":"1993","unstructured":"G. Laporte and F.V. Louveaux, \u201cThe integer L-shaped method for stochastic integer programs with complete recourse,\u201d Operations Research Letters, vol. 13, pp. 133-142, 1993.","journal-title":"Operations Research Letters"},{"key":"5113431_CR18","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0377-2217(89)90354-8","volume":"39","author":"G. Laporte","year":"1989","unstructured":"G. Laporte, F.V. Louveaux, and H. Mercure, \u201cModels and exact solutions for a class of stochastic locationrouting problems,\u201d European Journal of Operational Research, vol. 39, pp. 71-78, 1989.","journal-title":"European Journal of Operational Research"},{"key":"5113431_CR19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.26.3.161","volume":"26","author":"G. Laporte","year":"1992","unstructured":"G. Laporte, F.V. Louveaux, and H. Mercure, \u201cThe vehicle routing problem with stochastic travel times,\u201d Transportation Science, vol. 26, pp. 161-170, 1992.","journal-title":"Transportation Science"},{"key":"5113431_CR20","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/opre.42.3.543","volume":"42","author":"G. Laporte","year":"1994","unstructured":"G. Laporte, F.V. Louveaux, and H. Mercure, \u201cA priori optimization of the probabilistic traveling salesman problem,\u201d Operations Research, vol. 42, pp. 543-549, 1994.","journal-title":"Operations Research"},{"key":"5113431_CR21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1287\/trsc.28.2.95","volume":"28","author":"G. Laporte","year":"1994","unstructured":"G. Laporte, F.V. Louveaux, and L. van Hamme, \u201cExact solution of a stochastic location problem by an integer L-shaped algorithm,\u201d Transportation Science, vol. 28, pp. 95-103, 1994.","journal-title":"Transportation Science"},{"key":"5113431_CR22","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0167-6377(98)00054-6","volume":"24","author":"W.K. Mak","year":"1999","unstructured":"W.K. Mak, D.P. Morton, and R.K. Wood, \u201cMonte Carlo bounding techniques for determining solution quality in stochastic programs,\u201d Operations Research Letters, vol. 24, pp. 47-56, 1999.","journal-title":"Operations Research Letters"},{"key":"5113431_CR23","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, JohnWiley and Sons: New York, 1988."},{"key":"5113431_CR24","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/opre.46.3.381","volume":"46","author":"V.I. Norkin","year":"1998","unstructured":"V.I. Norkin, Y.M. E rmoliev, and A. Ruszczy\u0144ski, \u201cOn optimal allocation of indivisibles under uncertainty,\u201d Operations Research, vol. 46, pp. 381-395, 1998.","journal-title":"Operations Research"},{"key":"5113431_CR25","first-page":"425","volume":"83","author":"V.I. Norkin","year":"1998","unstructured":"V.I. Norkin, G.Ch. Pflug, and A. Ruszczy\u0144ski, \u201cAbranch and bound method for stochastic global optimization,\u201d Mathematical Programming, vol. 83, pp. 425-450, 1998.","journal-title":"Mathematical Programming"},{"key":"5113431_CR26","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M.W. Padberg","year":"1990","unstructured":"M.W. Padberg and G. Rinaldi, \u201cFacet identification for the symmetric traveling salesman polytope,\u201d Mathematical Programming, vol. 47, pp. 219-257, 1990.","journal-title":"Mathematical Programming"},{"key":"5113431_CR27","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M.W. Padberg","year":"1991","unstructured":"M.W. Padberg and G. Rinaldi, \u201cA branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems,\u201d SIAM Review, vol. 33, pp. 60-100, 1991.","journal-title":"SIAM Review"},{"key":"5113431_CR28","first-page":"137","volume":"75","author":"E.L. Plambeck","year":"1996","unstructured":"E.L. Plambeck, B.R. Fu, S.M. Robinson, and R. Suri, \u201cSample-path optimization of convex stochastic performance functions,\u201d Mathematical Programming, vol. 75, pp. 137-176, 1996.","journal-title":"Mathematical Programming"},{"key":"5113431_CR29","unstructured":"G. Reinelt, http:\/\/softlib.rice.edu\/softlib\/tsplib, 1995."},{"key":"5113431_CR30","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0378-4754(90)90142-6","volume":"32","author":"R.Y. Rubinstein","year":"1990","unstructured":"R.Y. Rubinstein and A. Shapiro, \u201cOptimization of static simulation models by the score function method,\u201d Mathematics and Computers in Simulation, vol. 32, pp. 373-392, 1990.","journal-title":"Mathematics and Computers in Simulation"},{"key":"5113431_CR31","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver, Theory of Linear and Integer Programming, John Wiley &; Sons: Chichester, 1986."},{"key":"5113431_CR32","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1080\/15326349608807393","volume":"12","author":"A. Shapiro","year":"1996","unstructured":"A. Shapiro, \u201cSimulation-based optimization: Convergence analysis and statistical inference,\u201d Stochastic Models, vol. 12, pp. 425-454, 1996.","journal-title":"Stochastic Models"},{"key":"5113431_CR33","first-page":"301","volume":"81","author":"A. Shapiro","year":"1998","unstructured":"A. Shapiro and T. Homem-de-Mello, \u201cA simulation-based approach to two-stage stochastic programming with recourse,\u201d Mathematical Programming, vol. 81, pp. 301-325, 1998.","journal-title":"Mathematical Programming"},{"key":"5113431_CR34","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/S1052623498349541","volume":"11","author":"A. Shapiro","year":"2001","unstructured":"A. Shapiro and T. Homem-de-Mello, \u201cOn rate of convergence of Monte Carlo approximations of stochastic programs,\u201d SIAM Journal on Optimization, vol. 11, pp. 70-86, 2001.","journal-title":"SIAM Journal on Optimization"},{"key":"5113431_CR35","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1002\/net.3230140408","volume":"14","author":"A.M. Spaccamela","year":"1984","unstructured":"A.M. Spaccamela, A.H.G. Rinnooy Kan, and L. Stougie, \u201cHierarchical vehicle routing problems,\u201d Networks, vol. 14, pp. 571-586, 1984.","journal-title":"Networks"},{"key":"5113431_CR36","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"R.M. Van Slyke","year":"1969","unstructured":"R.M. Van Slyke and R.J.-B. Wets, \u201cL-shaped linear programs with applications to optimal control and stochastic programming,\u201d SIAM Journal on Applied Mathematics, vol. 17, pp. 638-663, 1969.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"5113431_CR37","volume-title":"Selected applications of integer programming: A computational study","author":"A.M. Verweij","year":"2000","unstructured":"A.M. Verweij, \u201cSelected applications of integer programming: A computational study,\u201d Ph.D. Thesis, Department of Computer Science, Utrecht University, Utrecht, 2000."},{"key":"5113431_CR38","doi-asserted-by":"crossref","unstructured":"S.W. Wallace, \u201cSolving stochastic programs with network recourse,\u201d Networks, vol. 16, pp. 295-317, 1986.","DOI":"10.1002\/net.3230160306"},{"key":"5113431_CR39","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/net.3230170108","volume":"17","author":"S.W. Wallace","year":"1987","unstructured":"S.W. Wallace, \u201cInvesting in arcs in a network to maximize the expected max flow,\u201d Networks, vol. 17, pp. 87-103, 1987.","journal-title":"Networks"},{"key":"5113431_CR40","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/978-3-642-61370-8_28","volume-title":"Numerical Techniques for Stochastic Optimization","author":"S.W. Wallace","year":"1988","unstructured":"S.W. Wallace, \u201cA two-stage stochastic facility-location problem with time-dependent supply,\u201d in Numerical Techniques for Stochastic Optimization, Y. Ermoliev and R.J.-B. Wets, Springer-Verlag: Berlin, 1988, pp. 489-513."},{"key":"5113431_CR41","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/17442508308833274","volume":"10","author":"R.J-B. Wets","year":"1983","unstructured":"R.J-B. Wets, \u201cSolving stochastic programs with simple recourse,\u201d Stochastics, vol. 10, pp. 219-242, 1983.","journal-title":"Stochastics"},{"key":"5113431_CR42","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-61370-8_3","volume-title":"Numerical Techniques for Stochastic Optimization","author":"R.J.-B. Wets","year":"1988","unstructured":"R.J.-B. Wets, \u201cLarge scale linear programming techniques,\u201d in Numerical Techniques for Stochastic Optimization, Y. Ermoliev and R.J.-B Wets, Springer-Verlag: Berlin, 1988, pp. 65-93."},{"key":"5113431_CR43","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"L.A. Wolsey, Integer Programming, John Wiley and Sons: New York, 1998."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021814225969.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021814225969\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021814225969.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:06:18Z","timestamp":1752375978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021814225969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":43,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["5113431"],"URL":"https:\/\/doi.org\/10.1023\/a:1021814225969","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}