{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T12:24:55Z","timestamp":1764332695604,"version":"build-2065373602"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,9,29]],"date-time":"2018-09-29T00:00:00Z","timestamp":1538179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10898-018-0708-0","type":"journal-article","created":{"date-parts":[[2018,9,29]],"date-time":"2018-09-29T00:15:08Z","timestamp":1538180108000},"page":"839-859","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A cutting plane method for risk-constrained traveling salesman problem with random arc costs"],"prefix":"10.1007","volume":"74","author":[{"given":"Zhouchun","family":"Huang","sequence":"first","affiliation":[]},{"given":"Qipeng Phil","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Pasiliao","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Boginski","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,29]]},"reference":[{"key":"708_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D Applegate","year":"2006","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"issue":"1","key":"708_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-008-0239-4","volume":"122","author":"A Atamt\u00fcrk","year":"2010","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Conic mixed-integer rounding cuts. Math. Program. 122(1), 1\u201320 (2010)","journal-title":"Math. Program."},{"issue":"1","key":"708_CR3","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1287\/trsc.23.1.54","volume":"23","author":"O Berman","year":"1989","unstructured":"Berman, O.: The traveling salesman location problem on stochastic networks. Transp. Sci. 23(1), 54\u201357 (1989)","journal-title":"Transp. Sci."},{"issue":"3","key":"708_CR4","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/BF00121682","volume":"9","author":"JR Birge","year":"1996","unstructured":"Birge, J.R., Dempstert, M.A.H.: Stochastic programming approaches to stochastic scheduling. J. Glob. Optim. 9(3), 417\u2013451 (1996)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"708_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.1070.0203","volume":"42","author":"A Campbell","year":"2008","unstructured":"Campbell, A., Thomas, B.: Probabilistic traveling salesman problem with deadlines. Transp. Sci. 42(1), 1\u201321 (2008)","journal-title":"Transp. Sci."},{"issue":"5","key":"708_CR6","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1287\/opre.37.5.819","volume":"37","author":"R Carraway","year":"1989","unstructured":"Carraway, R., Morin, T., Moskowit, H.: Generalized dynamic programming for stochastic combinatorial optimization. Oper. Res. 37(5), 819\u2013829 (1989)","journal-title":"Oper. Res."},{"issue":"1","key":"708_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-005-0578-3","volume":"104","author":"M \u00c7ezik","year":"2005","unstructured":"\u00c7ezik, M., Iyengar, G.: Cuts for mixed 0\u20131 conic programming. Math. Program. 104(1), 179\u2013202 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"708_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1287\/mnsc.4.3.235","volume":"4","author":"A Charnes","year":"1958","unstructured":"Charnes, A., Cooper, W.W., Symonds, G.H.: Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil. Manag. Sci. 4(3), 235\u2013263 (1958)","journal-title":"Manag. Sci."},{"issue":"2","key":"708_CR9","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1287\/mnsc.10.2.335","volume":"10","author":"J Cord","year":"1964","unstructured":"Cord, J.: A method for allocating funds to investment projects when returns are subject to uncertainty. Manag. Sci. 10(2), 335\u2013341 (1964). \n                    https:\/\/doi.org\/10.1287\/mnsc.10.2.335","journal-title":"Manag. Sci."},{"key":"708_CR10","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2, 393\u2013410 (1954)","journal-title":"Oper. Res."},{"issue":"3","key":"708_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.3905\/jod.1997.407971","volume":"4","author":"D Duffie","year":"1997","unstructured":"Duffie, D., Pan, J.: An overview of value at risk. J. Deriv. 4(3), 7\u201349 (1997)","journal-title":"J. Deriv."},{"issue":"1","key":"708_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"M Flood","year":"1956","unstructured":"Flood, M.: The traveling-salesman problem. Oper. Res. 4(1), 61\u201375 (1956)","journal-title":"Oper. Res."},{"issue":"4","key":"708_CR13","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1287\/moor.1040.0105","volume":"29","author":"A Frieze","year":"2004","unstructured":"Frieze, A.: On random symmetric travelling salesman problems. Math. Oper. Res. 29(4), 878\u2013890 (2004). \n                    https:\/\/doi.org\/10.1287\/moor.1040.0105","journal-title":"Math. Oper. Res."},{"issue":"5","key":"708_CR14","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1137\/S0097539701391518","volume":"36","author":"A Frieze","year":"2007","unstructured":"Frieze, A., Sorkin, G.B.: The probabilistic relationship between the assignment and asymmetric traveling salesman problems. SIAM J. Comput. 36(5), 1435\u20131452 (2007)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"708_CR15","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1287\/mnsc.1100.1173","volume":"56","author":"I Gurvich","year":"2010","unstructured":"Gurvich, I., Luedtke, J., Tezcan, T.: Staffing call centers with uncertain demand forecasts: a chance-constrained optimization approach. Manag. Sci. 56(7), 1093\u20131115 (2010). \n                    https:\/\/doi.org\/10.1287\/mnsc.1100.1173","journal-title":"Manag. Sci."},{"issue":"1","key":"708_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10479-016-2244-y","volume":"249","author":"Z Huang","year":"2017","unstructured":"Huang, Z., Zheng, Q.P., Pasiliao, E.L., Simmons, D.: Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios. Ann. Oper. Res. 249(1), 141\u2013162 (2017)","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"708_CR17","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1287\/opre.36.6.929","volume":"36","author":"P Jaillet","year":"1988","unstructured":"Jaillet, P.: A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36(6), 929\u2013936 (1988)","journal-title":"Oper. Res."},{"issue":"6","key":"708_CR18","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1287\/opre.26.6.1033","volume":"26","author":"E Kao","year":"1978","unstructured":"Kao, E.: A preference order dynamic program for a stochastic traveling salesman problem. Oper. Res. 26(6), 1033\u20131045 (1978)","journal-title":"Oper. Res."},{"key":"708_CR19","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1137\/0208045","volume":"8","author":"RM Karp","year":"1979","unstructured":"Karp, R.M.: A patching algorithm for the nonsymmetric traveling-salesman problem. SIAM J. Comput. 8, 561\u2013573 (1979)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"708_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1287\/trsc.37.1.69.12820","volume":"37","author":"A Kenyon","year":"2003","unstructured":"Kenyon, A., Morton, D.: Stochastic vehicle routing with random travel times. Transp. Sci. 37(1), 69\u201382 (2003)","journal-title":"Transp. Sci."},{"issue":"3","key":"708_CR21","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1209\/0295-5075\/8\/3\/002","volume":"8","author":"W Krauth","year":"1989","unstructured":"Krauth, W., M\u00e9zard, M.: The cavity method and the traveling-salesman problem. Europhys. Lett. 8(3), 213\u2013218 (1989)","journal-title":"Europhys. Lett."},{"key":"708_CR22","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59, 231\u2013247 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"708_CR23","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1287\/opre.42.3.543","volume":"42","author":"G Laporte","year":"1994","unstructured":"Laporte, G., Louveaux, F., Ercure, H.: A priori optimization of the probabilistic traveling salesman problem. Oper. Res. 42(3), 543\u2013549 (1994)","journal-title":"Oper. Res."},{"key":"708_CR24","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0377-2217(78)90044-9","volume":"2","author":"T Leip\u00e4l\u00e4","year":"1978","unstructured":"Leip\u00e4l\u00e4, T.: On the solutions of stochastic traveling salesman problems. Eur. J. Oper. Res. 2, 291\u2013297 (1978)","journal-title":"Eur. J. Oper. Res."},{"key":"708_CR25","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-13036-6_21","volume-title":"Integer Programming and Combinatorial Optimization","author":"J Luedtke","year":"2010","unstructured":"Luedtke, J.: An integer programming and decomposition approach to general chance-constrained mathematical programs. In: Eisenbrand, F., Shepherd, F.B. (eds.) Integer Programming and Combinatorial Optimization, pp. 271\u2013284. Springer, Berlin (2010)"},{"issue":"2","key":"708_CR26","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(2), 674\u2013699 (2008)","journal-title":"SIAM J. Optim."},{"key":"708_CR27","doi-asserted-by":"crossref","unstructured":"Matai, R., Singh, S., Mittal, M.: Traveling salesman problem: an overview of applications, formulations, and solution approaches, chap. 1. In: Traveling Salesman Problem, Theory and Applications. InTech (2010)","DOI":"10.5772\/12909"},{"issue":"3","key":"708_CR28","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.ejor.2015.06.081","volume":"247","author":"R Miyashiro","year":"2015","unstructured":"Miyashiro, R., Takano, Y.: Mixed integer second-order cone programming formulations for variable selection in linear regression. Eur. J. Oper. Res. 247(3), 721\u2013731 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"708_CR29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics, Philadelphia (1994)"},{"key":"708_CR30","first-page":"91","volume":"9","author":"A Orman","year":"2007","unstructured":"Orman, A., Williams, H.: A survey of different integer programming formulations of the traveling salesman problem. Optim. Econ. Financ. Anal. 9, 91\u2013104 (2007)","journal-title":"Optim. Econ. Financ. Anal."},{"key":"708_CR31","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"B Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B., Ahmed, S., Shapiro, A.: Computational study of a chance constrained portfolio selection problem. J. Optim. Theory Appl. 142, 399\u2013416 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"708_CR32","doi-asserted-by":"crossref","unstructured":"Prekopa, A.: On probabilistic constrained programming. In: Proceedings of the Princeton Symposium on Mathematical Programming, vol. 113, p. 138 (1970)","DOI":"10.1515\/9781400869930-009"},{"key":"708_CR33","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1287\/ijoc.2013.0582","volume":"26","author":"F Qiu","year":"2014","unstructured":"Qiu, F., Ahmed, S., Dey, S., Wolsey, L.: Covering linear programming with violations. INFORMS J. Comput. 26, 531\u2013546 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"708_CR34","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s13676-012-0010-0","volume":"1","author":"R Roberti","year":"2012","unstructured":"Roberti, R., Toth, P.: Models and algorithms for the asymmetric traveling salesman problem: an experimental comparison. EURO J. Transp. Logist. 1(1), 113\u2013133 (2012)","journal-title":"EURO J. Transp. Logist."},{"issue":"3","key":"708_CR35","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"R Rockafellar","year":"2000","unstructured":"Rockafellar, R., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk 2(3), 21\u201341 (2000)","journal-title":"J. Risk"},{"key":"708_CR36","doi-asserted-by":"crossref","unstructured":"Sarykalin, S., Serraino, G., Uryasev, S.: Value-at-risk vs. conditional value-at-risk in risk management and optimization, chap. 13. In: State-of-the-Art Decision-Making Tools in the Information-Intensive Age, pp. 270\u2013294. INFORMS Institute for Operations Research (2008)","DOI":"10.1287\/educ.1080.0052"},{"key":"708_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)12001-5","volume-title":"On the History of Combinatorial Optimization Till 1960","author":"A Schrijver","year":"2005","unstructured":"Schrijver, A.: On the History of Combinatorial Optimization Till 1960. Elsevier, New York City (2005)"},{"issue":"2","key":"708_CR38","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-005-0658-4","volume":"105","author":"R Schultz","year":"2006","unstructured":"Schultz, R., Tiedemann, S.: Conditional value-at-risk in stochastic programs with mixed-integer recourse. Math. Program. 105(2), 365\u2013386 (2006)","journal-title":"Math. Program."},{"issue":"6","key":"708_CR39","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1287\/opre.29.6.1234","volume":"29","author":"M Sniedovich","year":"1981","unstructured":"Sniedovich, M.: Analysis of a preference order traveling salesman problem. Oper. Res. 29(6), 1234\u20131237 (1981)","journal-title":"Oper. Res."},{"issue":"3","key":"708_CR40","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/A:1020351410169","volume":"24","author":"RA Stubbs","year":"2002","unstructured":"Stubbs, R.A., Mehrotra, S.: Generating convex polynomial inequalities for mixed 0\u20131 programs. J. Glob. Optim. 24(3), 311\u2013332 (2002)","journal-title":"J. Glob. Optim."},{"issue":"5","key":"708_CR41","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1029\/98WR02771","volume":"35","author":"AK Takyi","year":"1999","unstructured":"Takyi, A.K., Lence, B.J.: Surface water quality management using a multiple-realization chance constraint method. Water Resour. Res. 35(5), 1657\u20131670 (1999)","journal-title":"Water Resour. Res."},{"issue":"1","key":"708_CR42","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10898-017-0572-3","volume":"70","author":"X Tong","year":"2018","unstructured":"Tong, X., Sun, H., Luo, X., Zheng, Q.: Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems. J. Glob. Optim. 70(1), 131\u2013158 (2018)","journal-title":"J. Glob. Optim."},{"issue":"5","key":"708_CR43","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1287\/opre.2014.1301","volume":"62","author":"A Toriello","year":"2014","unstructured":"Toriello, A., Haskell, W.B., Poremba, M.: A dynamic traveling salesman problem with stochastic arc costs. Oper. Res. 62(5), 1107\u20131125 (2014)","journal-title":"Oper. Res."},{"issue":"2","key":"708_CR44","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B Verweij","year":"2003","unstructured":"Verweij, B., Ahmed, S., Kleywegt, A.J., Nemhauser, G., Shapiro, A.: The sample average approximation method applied to stochastic routing problems: a computational study. Comput. Optim. Appl. 24(2), 289\u2013333 (2003)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"708_CR45","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10898-016-0438-0","volume":"67","author":"Y Yuan","year":"2017","unstructured":"Yuan, Y., Li, Z., Huang, B.: Robust optimization approximation for joint chance constrained optimization problem. J. Glob. Optim. 67(4), 805\u2013827 (2017)","journal-title":"J. Glob. Optim."},{"key":"708_CR46","unstructured":"Zeng, B., An, Y., Kuznia, L.: Chance constrained mixed integer program: bilinear and linear formulations, and benders decomposition (2014). \n                    arXiv:1403.7875"},{"issue":"9","key":"708_CR47","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1080\/0740817X.2014.991476","volume":"47","author":"QP Zheng","year":"2015","unstructured":"Zheng, Q.P., Shen, S., Shi, Y.: Loss-constrained minimum cost flow under arc failure uncertainty with applications in risk-aware kidney exchange. IIE Trans. 47(9), 961\u2013977 (2015)","journal-title":"IIE Trans."},{"issue":"4","key":"708_CR48","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1109\/TPWRS.2014.2355204","volume":"30","author":"QP Zheng","year":"2015","unstructured":"Zheng, Q.P., Wang, J., Liu, A.L.: Stochastic optimization for unit commitment\u2014a review. IEEE Trans. Power Syst. 30(4), 1913\u20131924 (2015)","journal-title":"IEEE Trans. Power Syst."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0708-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0708-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0708-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T11:18:38Z","timestamp":1579173518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0708-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,29]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["708"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0708-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2018,9,29]]},"assertion":[{"value":"27 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}