{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:15Z","timestamp":1740122715650,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,3,16]],"date-time":"2023-03-16T00:00:00Z","timestamp":1678924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,16]],"date-time":"2023-03-16T00:00:00Z","timestamp":1678924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010035","name":"Outstanding Youth Foundation of Jiangsu Province of China","doi-asserted-by":"publisher","award":["BK20210267"],"award-info":[{"award-number":["BK20210267"]}],"id":[{"id":"10.13039\/501100010035","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010905","name":"Major Research Plan","doi-asserted-by":"publisher","award":["11971230"],"award-info":[{"award-number":["11971230"]}],"id":[{"id":"10.13039\/501100010905","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10589-023-00470-7","type":"journal-article","created":{"date-parts":[[2023,3,16]],"date-time":"2023-03-16T12:03:02Z","timestamp":1678968182000},"page":"705-752","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributionally robust Weber problem with uncertain demand"],"prefix":"10.1007","volume":"85","author":[{"given":"Yan","family":"Gu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8641-9202","authenticated-orcid":false,"given":"Jianlin","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Shun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,16]]},"reference":[{"key":"470_CR1","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.trb.2011.11.006","volume":"46","author":"SA Alumur","year":"2012","unstructured":"Alumur, S.A., Nickel, S., Saldanha-da-Gama, F.: Hub location under uncertainty. Transp. Res. Part B: Methodol. 46, 529\u2013543 (2012)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"470_CR2","unstructured":"Arrow, K.J., Karlin, S., Scarf, H.E. et\u00a0al.: A min-max solution of an inventory problem. In: Studies in the Mathematical Theory of Inventory and Production, pp.\u00a0201\u2013209, Stanford University Press (1958)"},{"key":"470_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105181","volume":"130","author":"M Baldomero-Naranjo","year":"2021","unstructured":"Baldomero-Naranjo, M., Kalcsics, J., Rodr\u00edguez-Ch\u00eda, A.M.: Minmax regret maximal covering location problems with edge demands. Comput. Oper. Res. 130, 105181 (2021)","journal-title":"Comput. Oper. Res."},{"key":"470_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski A.: Robust Optimization. Princeton University Press, (2009)","DOI":"10.1515\/9781400831050"},{"key":"470_CR5","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1287\/mnsc.2018.3253","volume":"66","author":"D Bertsimas","year":"2020","unstructured":"Bertsimas, D., Kallus, N.: From predictive to prescriptive analytics. Manage. Sci. 66, 1025\u20131044 (2020)","journal-title":"Manage. Sci."},{"key":"470_CR6","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1137\/S1052623401399903","volume":"15","author":"D Bertsimas","year":"2005","unstructured":"Bertsimas, D., Popescu, I.: Optimal inequalities in probability theory: a convex optimization approach. SIAM J. Opt. 15, 780\u2013804 (2005)","journal-title":"SIAM J. Opt."},{"key":"470_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52, 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"470_CR8","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1137\/110825248","volume":"22","author":"X Chen","year":"2012","unstructured":"Chen, X., Wets, R.J.-B., Zhang, Y.: Stochastic variational inequalities: residual minimization smoothing sample average approximations. SIAM J. Opt. 22, 649\u2013673 (2012)","journal-title":"SIAM J. Opt."},{"key":"470_CR9","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, 595\u2013612 (2010)","journal-title":"Oper. Res."},{"key":"470_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1080\/17442508708833436","volume":"20","author":"J Dupa\u010dov\u00e1","year":"1987","unstructured":"Dupa\u010dov\u00e1, J.: The minimax approach to stochastic programming and an illustrative application. Stoch.: Int. J. Probab. Stoch. Process. 20, 73\u201388 (1987)","journal-title":"Stoch.: Int. J. Probab. Stoch. Process."},{"key":"470_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10107-005-0678-0","volume":"107","author":"E Erdo\u011fan","year":"2006","unstructured":"Erdo\u011fan, E., Iyengar, G.: Ambiguous chance constrained problems and robust optimization. Math. Program. 107, 37\u201361 (2006)","journal-title":"Math. Program."},{"key":"470_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-017-1172-1","volume":"171","author":"PM Esfahani","year":"2018","unstructured":"Esfahani, P.M., Kuhn, D.: Data-driven distributionally robust optimization using the wasserstein metric: performance guarantees and tractable reformulations. Math. Program. 171, 115\u2013166 (2018)","journal-title":"Math. Program."},{"key":"470_CR13","unstructured":"Facchinei,F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, Springer Science & Business Media (2007)"},{"key":"470_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"470_CR15","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1287\/opre.51.4.543.16101","volume":"51","author":"LE Ghaoui","year":"2003","unstructured":"Ghaoui, L.E., Oks, M., Oustry, F.: Worst-case value-at-risk and robust portfolio optimization: a conic programming approach. Oper. Res. 51, 543\u2013556 (2003)","journal-title":"Oper. Res."},{"key":"470_CR16","unstructured":"Giannessi, F., Maugeri, A., Pardalos, P.M.: Equilibrium Problems: Nonsmooth Optimization and Variational Inequality Models, Springer Science & Business Media (2006)"},{"key":"470_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1051\/m2an\/197509R200411","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de Dirichlet non lin\u00e9aires. Revue Fran\u00e7aise d\u2019Automatique, Informatique, et Recherche Op\u00e9rationnelle 9, 41\u201376 (1975)","journal-title":"Revue Fran\u00e7aise d\u2019Automatique, Informatique, et Recherche Op\u00e9rationnelle"},{"key":"470_CR18","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10589-010-9372-0","volume":"51","author":"B He","year":"2012","unstructured":"He, B., Liao, L.-Z., Wang, X.: Proximal-like contraction methods for monotone variational inequalities in a unified framework I: effective quadruplet and primary methods. Comput. Optim. Appl. 51, 649\u2013679 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"470_CR19","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s10589-010-9373-z","volume":"51","author":"B He","year":"2012","unstructured":"He, B., Liao, L.-Z., Wang, X.: Proximal-like contraction methods for monotone variational inequalities in a unified framework II: general methods and numerical experiments. Comput. Optim. Appl. 51, 681\u2013708 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"470_CR20","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ejor.2007.02.043","volume":"187","author":"J Jiang","year":"2008","unstructured":"Jiang, J., Yuan, X.: A heuristic algorithm for constrained multi-source Weber problem-The variational inequality approach. Eur. J. Oper. Res. 187, 357\u2013370 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"470_CR21","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1007\/s10589-010-9392-9","volume":"51","author":"J Jiang","year":"2012","unstructured":"Jiang, J., Yuan, X.: A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand. Comput. Optim. Appl. 51, 1275\u20131295 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"470_CR22","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/s10898-019-00796-9","volume":"76","author":"J Jiang","year":"2020","unstructured":"Jiang, J., Zhang, S., Lv, Y., Du, X., Yan, Z.: An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge. J. Glob. Optim. 76, 793\u2013818 (2020)","journal-title":"J. Glob. Optim."},{"key":"470_CR23","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10107-015-0929-7","volume":"158","author":"R Jiang","year":"2016","unstructured":"Jiang, R., Guan, Y.: Data-driven chance constrained stochastic program. Math. Program. 158, 291\u2013327 (2016)","journal-title":"Math. Program."},{"key":"470_CR24","doi-asserted-by":"publisher","first-page":"A1586","DOI":"10.1137\/15M1047192","volume":"39","author":"R Kawai","year":"2017","unstructured":"Kawai, R.: Acceleration on adaptive importance sampling with sample average approximation. SIAM J. Sci. Comput. 39, A1586\u2013A1615 (2017)","journal-title":"SIAM J. Sci. Comput."},{"key":"470_CR25","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0305-0548(02)00191-0","volume":"31","author":"Y Levin","year":"2004","unstructured":"Levin, Y., Ben-Israel, A.: A heuristic method for large-scale multi-facility location problems. Comput. Oper. Res. 31, 257\u2013272 (2004)","journal-title":"Comput. Oper. Res."},{"key":"470_CR26","unstructured":"Li, J., Chen, C., So, A.M.-C.: Fast epigraphical projection-based incremental algorithms for wasserstein distributionally robust support vector machine, In: Advances in Neural Information Processing Systems, vol.\u00a033, pp.\u00a04029\u20134039, Curran Associates, Inc. (2020)"},{"key":"470_CR27","doi-asserted-by":"publisher","first-page":"2095","DOI":"10.1137\/17M1144623","volume":"56","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Yuan, X., Zeng, S., Zhang, J.: Partial error bound conditions and the linear convergence rate of the alternating direction method of multipliers. SIAM J. Numer. Anal. 56, 2095\u20132123 (2018)","journal-title":"SIAM J. Numer. Anal."},{"key":"470_CR28","unstructured":"Lofberg, J.: YALMIP: a toolbox for modeling and optimization in MATLAB. In: 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No. 04CH37508), pp. 284\u2013289, IEEE, 2004"},{"key":"470_CR29","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.ejor.2018.02.003","volume":"269","author":"S Lotfi","year":"2018","unstructured":"Lotfi, S., Zenios, S.A.: Robust VaR and CVaR optimization under joint ambiguity in distributions, means, and covariances. Eur. J. Oper. Res. 269, 556\u2013576 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"470_CR30","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10957-008-9439-6","volume":"140","author":"M Luo","year":"2009","unstructured":"Luo, M., Lin, G.: Expected residual minimization method for stochastic variational inequality problems. J. Optim. Theory Appl. 140, 103\u2013116 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"470_CR31","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.: Concentration. In: Habib, M., Mcdiarmid, C., Jorge, R.A., Reed, B. (eds.) Probabilistic Methods for Algorithmic Discrete Mathematics, pp. 195\u2013248. Springer (1998)","DOI":"10.1007\/978-3-662-12788-9_6"},{"key":"470_CR32","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/opre.6.2.232","volume":"6","author":"W Miehle","year":"1958","unstructured":"Miehle, W.: Link-length minimization in networks. Oper. Res. 6, 232\u2013243 (1958)","journal-title":"Oper. Res."},{"key":"470_CR33","doi-asserted-by":"crossref","unstructured":"Nesterov,Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming, SIAM, (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"470_CR34","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"BK Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B.K., Ahmed, S., Shapiro, A.: Sample average approximation method for chance constrained programming: theory and applications. J. Optim. Theory Appl. 142, 399\u2013416 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"470_CR35","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1137\/S003614450444614X","volume":"49","author":"I P\u00f3lik","year":"2007","unstructured":"P\u00f3lik, I., Terlaky, T.: A survey of the S-lemma. SIAM Rev. 49, 371\u2013418 (2007)","journal-title":"SIAM Rev."},{"key":"470_CR36","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1287\/moor.1040.0137","volume":"30","author":"I Popescu","year":"2005","unstructured":"Popescu, I.: A semidefinite programming approach to optimal-moment bounds for convex classes of distributions. Math. Oper. Res. 30, 632\u2013657 (2005)","journal-title":"Math. Oper. Res."},{"key":"470_CR37","unstructured":"Rahimian,H., Mehrotra, S.: Distributionally robust optimization: A review, arXiv preprint arXiv:1908.05659, (2019)"},{"key":"470_CR38","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis, Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"key":"470_CR39","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1057\/jors.1972.72","volume":"23","author":"J Rosenhead","year":"1972","unstructured":"Rosenhead, J., Elton, M., Gupta, S.K.: Robustness and optimality as criteria for strategic decisions. J. Oper. Res. Soc. 23, 413\u2013431 (1972)","journal-title":"J. Oper. Res. Soc."},{"key":"470_CR40","doi-asserted-by":"crossref","unstructured":"Shapiro, A.: On duality theory of conic linear problems. In: Semi-Infinite Programming, pp. 135\u2013165, Springer (2001)","DOI":"10.1007\/978-1-4757-3403-4_7"},{"key":"470_CR41","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1080\/07408170500216480","volume":"38","author":"LV Snyder","year":"2006","unstructured":"Snyder, L.V.: Facility location under uncertainty: a review. IIE Trans. 38, 547\u2013564 (2006)","journal-title":"IIE Trans."},{"key":"470_CR42","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, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"470_CR43","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/PL00011435","volume":"90","author":"Y Vardi","year":"2001","unstructured":"Vardi, Y., Zhang, C.-H.: A modified weiszfeld algorithm for the Fermat-Weber location problem. Math. Program. 90, 559\u2013566 (2001)","journal-title":"Math. Program."},{"key":"470_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, 289\u2013333 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"470_CR45","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1287\/opre.33.5.1074","volume":"33","author":"JE Ward","year":"1985","unstructured":"Ward, J.E., Wendell, R.E.: Using block norms for location modeling. Operat. Res. 33, 1074\u20131090 (1985)","journal-title":"Operat. Res."},{"key":"470_CR46","first-page":"355","volume":"43","author":"E Weiszfeld","year":"1937","unstructured":"Weiszfeld, E.: Sur le point pour lequel la somme des distances de n points donn\u00e9s est minimum. Tohoku Math. J. 43, 355\u2013386 (1937)","journal-title":"Tohoku Math. J."},{"key":"470_CR47","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10107-017-1143-6","volume":"169","author":"H Xu","year":"2018","unstructured":"Xu, H., Liu, Y., Sun, H.: Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods. Math. Program. 169, 489\u2013529 (2018)","journal-title":"Math. Program."},{"key":"470_CR48","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1287\/opre.1060.0318","volume":"54","author":"J Yue","year":"2006","unstructured":"Yue, J., Chen, B., Wang, M.-C.: Expected value of distribution information for the newsvendor problem. Oper. Res. 54, 1128\u20131136 (2006)","journal-title":"Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00470-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00470-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00470-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:53:21Z","timestamp":1688489601000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00470-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,16]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["470"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00470-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2023,3,16]]},"assertion":[{"value":"31 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflicts of interest to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}