{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T04:39:44Z","timestamp":1780375184470,"version":"3.54.1"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T00:00:00Z","timestamp":1575244800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T00:00:00Z","timestamp":1575244800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["T2MOE1706"],"award-info":[{"award-number":["T2MOE1706"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007040","name":"Singapore University of Technology and Design","doi-asserted-by":"publisher","award":["IDG21700101"],"award-info":[{"award-number":["IDG21700101"]}],"id":[{"id":"10.13039\/501100007040","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10107-019-01453-5","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T16:23:51Z","timestamp":1575303831000},"page":"209-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Exploiting partial correlations in distributionally robust optimization"],"prefix":"10.1007","volume":"186","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2287-0440","authenticated-orcid":false,"given":"Divya","family":"Padmanabhan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karthik","family":"Natarajan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karthyek","family":"Murthy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,12,2]]},"reference":[{"issue":"4","key":"1453_CR1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1002\/rsa.1015","volume":"18","author":"DJ Aldous","year":"2001","unstructured":"Aldous, D.J.: The $$\\zeta (2)$$ limit in the random assignment problem. Random Struct. Algorithms 18(4), 381\u2013418 (2001)","journal-title":"Random Struct. Algorithms"},{"key":"1453_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-010-0355-9","volume":"124","author":"KM Anstreicher","year":"2010","unstructured":"Anstreicher, K.M., Burer, S.: Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. 124, 33\u201343 (2010)","journal-title":"Math. Program."},{"key":"1453_CR3","doi-asserted-by":"crossref","unstructured":"Ball, M.O., Colbourn, C.J., Provan, J.S.: Network reliability. In: Handbooks in Operations Research and Management Science, vol. 7, pp. 673\u2013762. Elsevier Science B.V., Amsterdam (1995)","DOI":"10.1016\/S0927-0507(05)80128-8"},{"key":"1453_CR4","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Cambridge (2009)"},{"key":"1453_CR5","first-page":"155","volume-title":"Graph Theory and Theoretical Physics","author":"C Berge","year":"1967","unstructured":"Berge, C.: Some classes of perfect graphs. In: Harary, F. (ed.) Graph Theory and Theoretical Physics, pp. 155\u2013166. Academic Press, London (1967)"},{"issue":"3","key":"1453_CR6","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1287\/moor.1100.0445","volume":"35","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., Doan, X.V., Natarajan, K., Teo, C.-P.: Models for minimax stochastic linear optimization problems with risk aversion. Math. Oper. Res. 35(3), 580\u2013602 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1453_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1137\/S1052623403430610","volume":"15","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Natarajan, K., Teo, C.-P.: Probabilistic combinatorial optimization: moments, semidefinite programming, and asymptotic bounds. SIAM J. Optim. 15(1), 185\u2013209 (2004)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1453_CR8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10107-006-0710-z","volume":"108","author":"D Bertsimas","year":"2006","unstructured":"Bertsimas, D., Natarajan, K., Teo, C.-P.: Persistence in discrete optimization under data uncertainty. Math. Program. 108(2), 251\u2013274 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"1453_CR9","doi-asserted-by":"crossref","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. Optim. 15(3), 780\u2013804 (2005)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1453_CR10","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1287\/mnsc.2017.2952","volume":"65","author":"D Bertsimas","year":"2018","unstructured":"Bertsimas, D., Sim, M., Zhang, M.: Adaptive distributionally robust optimization. Manag. Sci. 65(2), 604\u2013618 (2018)","journal-title":"Manag. Sci."},{"issue":"1\u20132","key":"1453_CR11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10107-017-1109-8","volume":"166","author":"IM Bomze","year":"2017","unstructured":"Bomze, I.M., Cheng, J., Dickinson, P.J.C., Lisser, A.: A fresh CP look at mixed-binary QPs: new formulations and relaxations. Math. Program. 166(1\u20132), 159\u2013184 (2017)","journal-title":"Math. Program."},{"issue":"2","key":"1453_CR12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., De Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Glob. Optim. 24(2), 163\u2013185 (2002)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1453_CR13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/rsa.10045","volume":"21","author":"MW Buck","year":"2002","unstructured":"Buck, M.W., Chan, C.S., Robbins, D.P.: On the expected value of the minimum assignment. Random Struct. Algorithms 21(1), 33\u201358 (2002)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"1453_CR14","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2010","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120(2), 479\u2013495 (2010)","journal-title":"Math. Program."},{"issue":"1","key":"1453_CR15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-015-0888-z","volume":"151","author":"S Burer","year":"2015","unstructured":"Burer, S.: A gentle, geometric introduction to copositive optimization. Math. Program. 151(1), 89\u2013116 (2015)","journal-title":"Math. Program."},{"issue":"4","key":"1453_CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00532695","volume":"36","author":"S Cambanis","year":"1976","unstructured":"Cambanis, S., Simons, G., Stout, W.: Inequalities for E k (x, y) when the marginals are fixed. Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete 36(4), 285\u2013294 (1976)","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete"},{"issue":"3","key":"1453_CR17","doi-asserted-by":"crossref","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(3), 595\u2013612 (2010)","journal-title":"Oper. Res."},{"issue":"1","key":"1453_CR18","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.jmaa.2011.03.005","volume":"380","author":"PJC Dickinson","year":"2011","unstructured":"Dickinson, P.J.C.: Geometry of the copositive and completely positive cones. J. Math. Anal. Appl. 380(1), 377\u2013395 (2011)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"1453_CR19","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10589-013-9594-z","volume":"57","author":"PJC Dickinson","year":"2014","unstructured":"Dickinson, P.J.C., Gijben, L.: On the computational complexity of membership problems for the completely positive cone and its dual. Comput. Optim. Appl. 57(2), 403\u2013415 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1453_CR20","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1287\/opre.1110.1005","volume":"60","author":"XV Doan","year":"2012","unstructured":"Doan, X.V., Natarajan, K.: On the complexity of nonoverlapping multivariate marginal bounds for probabilistic combinatorial optimization problems. Oper. Res. 60(1), 138\u2013149 (2012)","journal-title":"Oper. Res."},{"issue":"4","key":"1453_CR21","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1147\/rd.134.0380","volume":"13","author":"WE Donath","year":"1969","unstructured":"Donath, W.E.: Algorithm and average-value bounds for assignment problems. IBM J. Res. Dev. 13(4), 380\u2013386 (1969)","journal-title":"IBM J. Res. Dev."},{"issue":"1","key":"1453_CR22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01589437","volume":"35","author":"ME Dyer","year":"1986","unstructured":"Dyer, M.E., Frieze, A.M., Mcdiarmid, C.J.H.: On linear programs with random costs. Math. Program. 35(1), 3\u201316 (1986)","journal-title":"Math. Program."},{"issue":"6","key":"1453_CR23","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1287\/opre.10.6.808","volume":"10","author":"DR Fulkerson","year":"1962","unstructured":"Fulkerson, D.R.: Expected critical path lengths in pert networks. Oper. Res. 10(6), 808\u2013817 (1962)","journal-title":"Oper. Res."},{"key":"1453_CR24","doi-asserted-by":"crossref","DOI":"10.23943\/princeton\/9780691172767.001.0001","volume-title":"Optimal Transport Methods in Economics","author":"A Galichon","year":"2016","unstructured":"Galichon, A.: Optimal Transport Methods in Economics. Princeton University Press, Princeton (2016)"},{"issue":"2","key":"1453_CR25","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/moor.18.2.267","volume":"18","author":"MX Goemans","year":"1993","unstructured":"Goemans, M.X., Kodialam, M.S.: A lower bound on the expected cost of an optimal assignment. Math. Oper. Res. 18(2), 267\u2013274 (1993)","journal-title":"Math. Oper. Res."},{"key":"1453_CR26","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R Grone","year":"1984","unstructured":"Grone, R., Johnson, C.R., S\u00e1, E.M., Wolkowicz, H.: Positive definite completions of partial hermitian matrices. Linear Algebra Appl. 58, 109\u2013124 (1984)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1453_CR27","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/net.3230180206","volume":"18","author":"JN Hagstrom","year":"1988","unstructured":"Hagstrom, J.N.: Computational complexity of pert problems. Networks 18(2), 139\u2013147 (1988)","journal-title":"Networks"},{"issue":"3","key":"1453_CR28","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.2017.1698","volume":"66","author":"GA Hanasusanto","year":"2018","unstructured":"Hanasusanto, G.A., Kuhn, D.: Conic programming reformulations of two-stage distributionally robust linear programs over wasserstein balls. Oper. Res. 66(3), 849\u2013869 (2018)","journal-title":"Oper. Res."},{"issue":"1","key":"1453_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-014-0776-y","volume":"152","author":"GA Hanasusanto","year":"2015","unstructured":"Hanasusanto, G.A., Kuhn, D., Wallace, S.W., Zymler, S.: Distributionally robust multi-item newsvendor problems with multimodal demand distributions. Math. Program. 152(1), 1\u201332 (2015)","journal-title":"Math. Program."},{"issue":"6","key":"1453_CR30","doi-asserted-by":"crossref","first-page":"1638","DOI":"10.1287\/opre.2017.1656","volume":"65","author":"R Jiang","year":"2017","unstructured":"Jiang, R., Shen, S., Zhang, Y.: Integer programming approaches for appointment scheduling with random no-shows and service durations. Oper. Res. 65(6), 1638\u20131656 (2017)","journal-title":"Oper. Res."},{"key":"1453_CR31","first-page":"1","volume-title":"Discrete Algorithms and Complexity","author":"RM Karp","year":"1987","unstructured":"Karp, R.M.: An upper bound on the expected cost of an optimal assignment. In: Johnson, D.S., Nishizeki, T., Nozaki, A., Wilf, H.S. (eds.) Discrete Algorithms and Complexity, pp. 1\u20134. Academic Press, New York (1987)"},{"issue":"3","key":"1453_CR32","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1287\/opre.2013.1158","volume":"61","author":"Q Kong","year":"2013","unstructured":"Kong, Q., Lee, C.-Y., Teo, C.-P., Zheng, Z.: Scheduling arrivals to a stochastic service delivery system using copositive cones. Oper. Res. 61(3), 711\u2013726 (2013)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"1453_CR33","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"issue":"4","key":"1453_CR34","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/321138.321140","volume":"9","author":"JM Kurtzberg","year":"1962","unstructured":"Kurtzberg, J.M.: On approximation methods for the assignment problem. J. ACM 9(4), 419\u2013439 (1962)","journal-title":"J. ACM"},{"key":"1453_CR35","first-page":"1967","volume-title":"Matrix Completion Problems","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Matrix Completion Problems, pp. 1967\u20131975. Springer, Boston (2009)"},{"issue":"4","key":"1453_CR36","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0167-6377(93)90071-N","volume":"14","author":"AJ Lazarus","year":"1993","unstructured":"Lazarus, A.J.: Certain expected values in the random assignment problem. Oper. Res. Lett. 14(4), 207\u2013214 (1993)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1453_CR37","doi-asserted-by":"crossref","first-page":"176","DOI":"10.2307\/2307574","volume":"60","author":"GG Lorentz","year":"1953","unstructured":"Lorentz, G.G.: An inequality for rearrangements. Am. Math. Month. 60(3), 176\u2013179 (1953)","journal-title":"Am. Math. Month."},{"issue":"2","key":"1453_CR38","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/mnsc.2013.1881","volume":"61","author":"H-Y Mak","year":"2015","unstructured":"Mak, H.-Y., Rong, Y., Zhang, J.: Appointment scheduling with limited distributional information. Manag. Sci. 61(2), 316\u2013334 (2015)","journal-title":"Manag. Sci."},{"issue":"9","key":"1453_CR39","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1051\/jphys:019870048090145100","volume":"48","author":"M M\u00e9zard","year":"1987","unstructured":"M\u00e9zard, M., Parisi, G.: On the solution of the random link matching problems. J. Phys. 48(9), 1451\u20131459 (1987)","journal-title":"J. Phys."},{"key":"1453_CR40","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-45506-X_7","volume-title":"Computational Discrete Mathematics","author":"RH M\u00f6hring","year":"2001","unstructured":"M\u00f6hring, R.H.: Scheduling under uncertainty: bounding the makespan distribution. In: Alt, H. (ed.) Computational Discrete Mathematics, pp. 79\u201397. Springer, Berlin (2001)"},{"issue":"1","key":"1453_CR41","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"2","key":"1453_CR42","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K.G., Kabadi, S.N.: Some np-complete problems in quadratic and nonlinear programming. Math. Program. 39(2), 117\u2013129 (1987)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1453_CR43","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10107-016-1019-1","volume":"161","author":"K Natarajan","year":"2017","unstructured":"Natarajan, K., Teo, C.-P.: On reduced semidefinite programs for second order moment bounds with applications. Math. Program. 161(1\u20132), 487\u2013518 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"1453_CR44","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1287\/opre.1110.0918","volume":"59","author":"K Natarajan","year":"2011","unstructured":"Natarajan, K., Teo, C.-P., Zheng, Z.: Mixed 0\u20131 linear programs under objective uncertainty: a completely positive representation. Oper. Res. 59(3), 713\u2013728 (2011)","journal-title":"Oper. Res."},{"key":"1453_CR45","unstructured":"Olin, B.: Asymptotic properties of random assignment problems. PhD thesis, Division of Optimization and Systems Theory, Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden (1992)"},{"issue":"1","key":"1453_CR46","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M.: The boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45(1), 139\u2013172 (1989)","journal-title":"Math. Program."},{"key":"1453_CR47","unstructured":"Parrillo, P.A.: Structured semidefinite programs and semi-algebraic geometry methods in robustness. Ph.D. Thesis, California Institute of Technology (2000)"},{"issue":"3","key":"1453_CR48","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1017\/S0305004100030401","volume":"51","author":"R Penrose","year":"1955","unstructured":"Penrose, R.: A generalized inverse for matrices. Math. Proc. Camb. Philos. Soc. 51(3), 406\u2013413 (1955)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"issue":"1","key":"1453_CR49","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01594946","volume":"50","author":"I Pitowsky","year":"1991","unstructured":"Pitowsky, I.: Correlation polytopes: their geometry and complexity. Math. Program. 50(1), 395\u2013414 (1991)","journal-title":"Math. Program."},{"key":"1453_CR50","doi-asserted-by":"crossref","unstructured":"Radhakrishna Rao, C., Mitra, S.K.: Generalized inverse of a matrix and its applications. In: Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Theory of Statistics, pp. 601\u2013620. University of California Press, Berkeley (1972)","DOI":"10.1525\/9780520325883-032"},{"issue":"3","key":"1453_CR51","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"DJ Rose","year":"1970","unstructured":"Rose, D.J.: Triangulated graphs and the elimination process. J. Math. Anal. Appl. 32(3), 597\u2013609 (1970)","journal-title":"J. Math. Anal. Appl."},{"issue":"4","key":"1453_CR52","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/net.3230070407","volume":"7","author":"AW Shogan","year":"1977","unstructured":"Shogan, A.W.: Bounding distributions for a stochastic pert network. Networks 7(4), 359\u2013381 (1977)","journal-title":"Networks"},{"key":"1453_CR53","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., Tutuncu, R.H.: SDPT3\u2014a matlab software package for semidefinite programming. Optim. Methods Softw. 11, 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"95","key":"1453_CR54","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"B","author":"RH Tutuncu","year":"2003","unstructured":"Tutuncu, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. Ser. B(95), 189\u2013217 (2003)","journal-title":"Math. Program. Ser."},{"issue":"5","key":"1453_CR55","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1287\/opre.11.5.839","volume":"11","author":"RM Van Slyke","year":"1963","unstructured":"Van Slyke, R.M.: Monte Carlo methods and the pert problem. Oper. Res. 11(5), 839\u2013860 (1963)","journal-title":"Oper. Res."},{"issue":"3","key":"1453_CR56","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0208036","volume":"8","author":"D Walkup","year":"1979","unstructured":"Walkup, D.: On the expected value of a random assignment problem. SIAM J. Comput. 8(3), 440\u2013442 (1979)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"1453_CR57","doi-asserted-by":"crossref","first-page":"1358","DOI":"10.1287\/opre.2014.1314","volume":"62","author":"W Wiesemann","year":"2014","unstructured":"Wiesemann, W., Kuhn, D., Sim, M.: Distributionally robust convex optimization. Oper. Res. 62(6), 1358\u20131376 (2014)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"1453_CR58","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/rsa.20066","volume":"26","author":"J W\u00e4stlund","year":"2005","unstructured":"W\u00e4stlund, J.: A proof of a conjecture of buck, chan, and robbins on the expected value of the minimum assignment. Random Struct. Algorithms 26(1\u20132), 237\u2013251 (2005)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"1453_CR59","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10287-018-0298-9","volume":"15","author":"X Guanglin","year":"2018","unstructured":"Guanglin, X., Burer, S.: A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0\u20131 linear programming. Comput. Manag. Sci. 15(1), 111\u2013134 (2018)","journal-title":"Comput. Manag. Sci."},{"issue":"2","key":"1453_CR60","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s10107-017-1157-0","volume":"170","author":"AKY Boshi","year":"2018","unstructured":"Boshi, A.K.Y., Burer, S.: Quadratic programs with hollows. Math. Program. 170(2), 541\u2013552 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"1453_CR61","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1287\/mnsc.13.1.105","volume":"13","author":"WI Zangwill","year":"1966","unstructured":"Zangwill, W.I.: A deterministic multi-period production scheduling model with backlogging. Manag. Sci. 13(1), 105\u2013119 (1966)","journal-title":"Manag. Sci."},{"issue":"9","key":"1453_CR62","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1287\/mnsc.15.9.506","volume":"15","author":"WI Zangwill","year":"1969","unstructured":"Zangwill, W.I.: A backlogging model and a multi-echelon model of a dynamic economic lot size production system\u2014a network approach. Manag. Sci. 15(9), 506\u2013527 (1969)","journal-title":"Manag. Sci."},{"issue":"2","key":"1453_CR63","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1287\/moor.1040.0124","volume":"30","author":"LF Zuluaga","year":"2005","unstructured":"Zuluaga, L.F., Pe\u00f1a, J.F.: A conic programming approach to generalized Tchebycheff inequalities. Math. Oper. Res. 30(2), 369\u2013388 (2005)","journal-title":"Math. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01453-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01453-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01453-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T09:41:39Z","timestamp":1613036499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01453-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,2]]},"references-count":63,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1453"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01453-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,2]]},"assertion":[{"value":"21 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}