{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:21:13Z","timestamp":1771456873268,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,5,4]],"date-time":"2016-05-04T00:00:00Z","timestamp":1462320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,5,4]],"date-time":"2016-05-04T00:00:00Z","timestamp":1462320000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-12-1-0142"],"award-info":[{"award-number":["FA9550-12-1-0142"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"publisher","award":["HDTRA1-14-1-0065"],"award-info":[{"award-number":["HDTRA1-14-1-0065"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006831","name":"U.S. Air Force","doi-asserted-by":"publisher","award":["FA8651-14-2-0003"],"award-info":[{"award-number":["FA8651-14-2-0003"]}],"id":[{"id":"10.13039\/100006831","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10479-016-2212-6","type":"journal-article","created":{"date-parts":[[2016,5,4]],"date-time":"2016-05-04T11:58:24Z","timestamp":1462363104000},"page":"89-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights"],"prefix":"10.1007","volume":"262","author":[{"given":"Maciej","family":"Rysz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Foad Mahdavi","family":"Pajouh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavlo","family":"Krokhmal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo L.","family":"Pasiliao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,4]]},"reference":[{"key":"2212_CR1","doi-asserted-by":"crossref","unstructured":"Abello, J., Pardalos, P., & Resende, M. (1999). On maximum clique problems in very large graphs. In Abello, J. and Vitter, J. (Eds.) External memory algorithms and visualization, volume\u00a050 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pp. 119\u2013130. Providence, RI: American Mathematical Society.","DOI":"10.1090\/dimacs\/050\/06"},{"key":"2212_CR2","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical informatics","author":"J Abello","year":"2002","unstructured":"Abello, J., Resende, M., & Sudarsky, S. (2002). Massive quasi-clique detection. In S. Rajsbaum (Ed.), LATIN 2002: Theoretical informatics (pp. 598\u2013612). London: Springer."},{"key":"2212_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"RD Alba","year":"1973","unstructured":"Alba, R. D. (1973). A graph-theoretic definition of a sociometric clique. Journal of Mathematical Sociology, 3, 3\u2013113.","journal-title":"Journal of Mathematical Sociology"},{"issue":"4","key":"2212_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1002\/net.10001","volume":"38","author":"YP Aneja","year":"2001","unstructured":"Aneja, Y. P., Chandrasekaran, R., & Nair, K. P. K. (2001). Maximizing residual flow under an arc destruction. Networks, 38(4), 194\u2013198.","journal-title":"Networks"},{"issue":"3","key":"2212_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1111\/1467-9965.00068","volume":"9","author":"P Artzner","year":"1999","unstructured":"Artzner, P., Delbaen, F., Eber, J.-M., & Heath, D. (1999). Coherent measures of risk. Mathematical Finance, 9(3), 203\u2013228.","journal-title":"Mathematical Finance"},{"issue":"4","key":"2212_CR6","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1287\/opre.1070.0428","volume":"55","author":"A Atamtrk","year":"2007","unstructured":"Atamtrk, A., & Zhang, M. (2007). Two-stage robust network flow and design under demand uncertainty. Operations Research, 55(4), 662\u2013673.","journal-title":"Operations Research"},{"issue":"1","key":"2212_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF02243394","volume":"52","author":"L Babel","year":"1994","unstructured":"Babel, L. (1994). A fast algorithm for the maximum weight clique problem. Computing, 52(1), 31\u201338.","journal-title":"Computing"},{"issue":"4","key":"2212_CR8","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas, E., & Yu, C. S. (1986). Finding a maximum clique in an arbitrary graph. SIAM Journal on Computing, 15(4), 1054\u20131068.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"2212_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","volume":"10","author":"B Balasundaram","year":"2005","unstructured":"Balasundaram, B., Butenko, S., & Trukhanov, S. (2005). Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization, 10(1), 23\u201339.","journal-title":"Journal of Combinatorial Optimization"},{"key":"2212_CR10","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1007\/978-1-4419-7997-1_9","volume-title":"Handbook of combinatorial optimization","author":"B Balasundaram","year":"2013","unstructured":"Balasundaram, B., & Pajouh, F. M. (2013). Graph theoretic clique relaxations and applications. In P. M. Pardalos, D.-Z. Du, & R. Graham (Eds.), Handbook of combinatorial optimization (2nd ed., pp. 1559\u20131598). Berlin: Springer.","edition":"2"},{"key":"2212_CR11","unstructured":"Barabasi, A. (2012). Network science. Center for Complex Network Research at Northeastern University (\n                    http:\/\/barabasilab.neu.edu\/networksciencebook\/downlPDF.html\n                    \n                  ), Boston, MA."},{"issue":"11","key":"2212_CR12","doi-asserted-by":"publisher","first-page":"3171","DOI":"10.1016\/j.cor.2005.01.027","volume":"33","author":"V Boginski","year":"2006","unstructured":"Boginski, V., Butenko, S., & Pardalos, P. (2006). Mining market data: A network approach. Computers & Operations Research, 33(11), 3171\u20133184.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2212_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0377-2217(01)00133-3","volume":"138","author":"J-M Bourjolly","year":"2002","unstructured":"Bourjolly, J.-M., Laporte, G., & Pesant, G. (2002). An exact algorithm for the maximum k-club problem in an undirected graph. European Journal of Operational Research, 138(1), 21\u201328.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2212_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.1070.0203","volume":"42","author":"AM Campbell","year":"2008","unstructured":"Campbell, A. M., & Thomas, B. W. (2008). Probabilistic traveling salesman problem with deadlines. Transportation Science, 42(1), 1\u201321.","journal-title":"Transportation Science"},{"issue":"2","key":"2212_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s13173-011-0050-6","volume":"18","author":"R Carmo","year":"2012","unstructured":"Carmo, R., & Zge, A. (2012). Branch and bound algorithms for the maximum clique problem under a unified framework. Journal of the Brazilian Computer Society, 18(2), 137\u2013151.","journal-title":"Journal of the Brazilian Computer Society"},{"issue":"6","key":"2212_CR16","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan, R., & Pardalos, P. M. (1990). An exact algorithm for the maximum clique problem. Operations Research Letters, 9(6), 375\u2013382.","journal-title":"Operations Research Letters"},{"issue":"9","key":"2212_CR17","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/s00607-012-0263-3","volume":"95","author":"M-S Chang","year":"2013","unstructured":"Chang, M.-S., Hung, L.-J., Lin, C.-R., & Su, P.-C. (2013). Finding large k-clubs in undirected graphs. Computing, 95(9), 739\u2013758.","journal-title":"Computing"},{"issue":"2","key":"2212_CR18","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"DJ Cook","year":"2000","unstructured":"Cook, D. J., & Holder, L. B. (2000). Graph-based data mining. IEEE Intelligent Systems, 15(2), 32\u201341.","journal-title":"IEEE Intelligent Systems"},{"key":"2212_CR19","doi-asserted-by":"crossref","unstructured":"Delbaen, F. (2002). Coherent risk measures on general probability spaces, pp. 1\u201337.","DOI":"10.1007\/978-3-662-04790-3_1"},{"issue":"2","key":"2212_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/opre.48.2.233.12384","volume":"48","author":"GD Glockner","year":"2000","unstructured":"Glockner, G. D., & Nemhauser, G. L. (2000). A dynamic network flow problem with uncertain arc capacities: Formulation and problem structure. Operations Research, 48(2), 233\u2013242.","journal-title":"Operations Research"},{"issue":"1","key":"2212_CR21","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. (2012). Technical note approximation algorithms for vrp with stochastic demands. Operations Research, 60(1), 123\u2013127.","journal-title":"Operations Research"},{"key":"2212_CR22","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1214\/088342306000000222","volume":"22","author":"S Hill","year":"2006","unstructured":"Hill, S., Provost, F., & Volinsky, C. (2006). Network-based marketing: Identifying likely adopters via consumer networks. Statistical Science, 22, 256\u2013275.","journal-title":"Statistical Science"},{"key":"2212_CR23","doi-asserted-by":"publisher","first-page":"5","DOI":"10.2307\/3172489","volume":"24","author":"D Iacobucci","year":"1992","unstructured":"Iacobucci, D., & Hopkins, N. (1992). Modeling dyadic interactions and networks in marketing. Journal of Marketing Research, 24, 5\u201317.","journal-title":"Journal of Marketing Research"},{"key":"2212_CR24","first-page":"5","volume":"4","author":"J Konc","year":"2007","unstructured":"Konc, J., & Janezic, D. (2007). An improved branch and bound algorithm for the maximum clique problem. Proteins, 4, 5.","journal-title":"Proteins"},{"issue":"3","key":"2212_CR25","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2009.03.053","volume":"301","author":"P Krokhmal","year":"2010","unstructured":"Krokhmal, P., & Soberanis, P. (2010). Risk optimization with $$p$$-order conic constraints: A linear programming approach. European Journal of Operational Research, 301(3), 653\u2013671.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2212_CR26","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.sorms.2010.08.001","volume":"16","author":"P Krokhmal","year":"2011","unstructured":"Krokhmal, P., Zabarankin, M., & Uryasev, S. (2011). Modeling and optimization of risk. Surveys in Operations Researh and Management Science, 16(2), 49\u201366.","journal-title":"Surveys in Operations Researh and Management Science"},{"key":"2212_CR27","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1080\/14697680701458307","volume":"7","author":"PA Krokhmal","year":"2007","unstructured":"Krokhmal, P. A. (2007). Higher moment coherent risk measures. Quantitative Finance, 7, 373\u2013387.","journal-title":"Quantitative Finance"},{"key":"2212_CR28","unstructured":"Kumlander, D. (2004). A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search. In Proceedings of the Fourth International conference on engineering computational technology, pp. 137\u2013138. Civil-Comp Press."},{"issue":"2","key":"2212_CR29","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"R Luce","year":"1950","unstructured":"Luce, R. (1950). Connectivity and generalized cliques in sociometric group structure. Psychometrika, 15(2), 169\u2013190.","journal-title":"Psychometrika"},{"issue":"2","key":"2212_CR30","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"R Mokken","year":"1979","unstructured":"Mokken, R. (1979). Cliques, clubs and clans. Quality and Quantity, 13(2), 161\u2013173.","journal-title":"Quality and Quantity"},{"issue":"3","key":"2212_CR31","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1016\/j.ejor.2013.06.053","volume":"231","author":"Y Morenko","year":"2013","unstructured":"Morenko, Y., Vinel, A., Yu, Z., & Krokhmal, P. (2013). On $$p$$-cone linear discrimination. European Journal of Operational Research, 231(3), 784\u2013789.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2212_CR32","first-page":"424","volume":"8","author":"PRJ \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd, P. R. J. (2001). A new algorithm for the maximum-weight clique problem. Nordic Journal of Computing, 8(4), 424\u2013436.","journal-title":"Nordic Journal of Computing"},{"issue":"1\u20133","key":"2212_CR33","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P. R. J. (2002). A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, 120(1\u20133), 197\u2013207. (Special Issue devoted to the 6th Twente Workshop on Graphs and Combinatorial Optimization).","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"2212_CR34","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.disopt.2012.02.002","volume":"9","author":"FM Pajouh","year":"2012","unstructured":"Pajouh, F. M., & Balasundaram, B. (2012). On inclusionwise maximal and maximum cardinality k-clubs in graphs. Discrete Optimization, 9(2), 84\u201397.","journal-title":"Discrete Optimization"},{"issue":"1\u20132","key":"2212_CR35","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.dam.2012.07.019","volume":"161","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Veremyev, A., Butenko, S., & Boginski, V. (2013). On the maximum quasi-clique problem. Discrete Applied Mathematics, 161(1\u20132), 244\u2013257.","journal-title":"Discrete Applied Mathematics"},{"key":"2212_CR36","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.sorms.2013.03.001","volume":"18","author":"RT Rockafellar","year":"2013","unstructured":"Rockafellar, R. T., & Uryasev, S. (2013). The fundamental risk quadrangle in risk management, optimization and statistical estimation. Surveys in Operations Research and Management Science, 18, 33\u201353.","journal-title":"Surveys in Operations Research and Management Science"},{"issue":"1","key":"2212_CR37","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00780-005-0165-8","volume":"10","author":"RT Rockafellar","year":"2006","unstructured":"Rockafellar, R. T., Uryasev, S., & Zabarankin, M. (2006). Generalized deviations in risk analysis. Finance and Stochastics, 10(1), 51\u201374.","journal-title":"Finance and Stochastics"},{"issue":"1","key":"2212_CR38","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10878-014-9718-0","volume":"28","author":"M Rysz","year":"2014","unstructured":"Rysz, M., Mirghorbani, M., Krokhmal, P., & Pasiliao, E. (2014). On risk-averse maximum weighted subgraph problems. Journal of Combinatorial Optimization, 28(1), 167\u2013185.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"5","key":"2212_CR39","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s11590-011-0311-5","volume":"6","author":"A Schfer","year":"2012","unstructured":"Schfer, A., Komusiewicz, C., Moser, H., & Niedermeier, R. (2012). Parameterized computational complexity of finding small-diameter subgraphs. Optimization Letters, 6(5), 883\u2013891.","journal-title":"Optimization Letters"},{"key":"2212_CR40","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman, S. B., & Foster, B. L. (1978). A graph theoretic generalization of the clique concept. Journal of Mathematical Sociology, 6, 139\u2013154.","journal-title":"Journal of Mathematical Sociology"},{"key":"2212_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-11440-3_18","volume-title":"WALCOM: Algorithms and Computation","author":"E Tomita","year":"2010","unstructured":"Tomita, E., Sutani, Y., Higashi, T., Takahashi, S., & Wakatsuki, M. (2010). A simple and faster branch-and-bound algorithm for finding a maximum clique. In M. Rahman & S. Fujita (Eds.), WALCOM: Algorithms and Computation (Vol. 5942, pp. 191\u2013203)., Lecture Notes in Computer Science Berlin Heidelberg: Springer."},{"issue":"1","key":"2212_CR42","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10589-013-9548-5","volume":"56","author":"S Trukhanov","year":"2013","unstructured":"Trukhanov, S., Balasubramaniam, C., Balasundaram, B., & Butenko, S. (2013). Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Computational Optimization and Applications, 56(1), 113\u2013130.","journal-title":"Computational Optimization and Applications"},{"key":"2212_CR43","unstructured":"Veremyev, A., Prokopyev, O., and Pasiliao, E. (2014). Critical nodes for communication efficiency and related problems in graphs. Working Paper."},{"issue":"2\u20133","key":"2212_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., Nemhauser, G., & Shapiro, A. (2003). The sample average approximation method applied to stochastic routing problems: A computational study. Computational Optimization and Applications, 24(2\u20133), 289\u2013333.","journal-title":"Computational Optimization and Applications"},{"issue":"6","key":"2212_CR45","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1080\/10556788.2013.877905","volume":"29","author":"A Vinel","year":"2014","unstructured":"Vinel, A., & Krokhmal, P. (2014). Polyhedral approximations in $$p$$-order cone programming. Optimization Methods and Software, 29(6), 1210\u20131237.","journal-title":"Optimization Methods and Software"},{"issue":"4","key":"2212_CR46","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1080\/00913367.1976.10672658","volume":"5","author":"AG Woodside","year":"1976","unstructured":"Woodside, A. G., & DeLozier, M. W. (1976). Effects of word of mouth advertising on consumer risk taking. Journal of Advertising, 5(4), 12\u201319.","journal-title":"Journal of Advertising"},{"key":"2212_CR47","unstructured":"Yannakakis, M. (1978). Node-and edge-deletion np-complete problems. In STOC\u201978: Proceedings of the 10th annual ACM symposium on theory of computing, pp. 253\u2013264, New York: ACM Press."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2212-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2212-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2212-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2212-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T15:37:39Z","timestamp":1589729859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2212-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,4]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["2212"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2212-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,4]]},"assertion":[{"value":"4 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}