{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:22:38Z","timestamp":1771456958356,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10878-014-9718-0","type":"journal-article","created":{"date-parts":[[2014,2,28]],"date-time":"2014-02-28T03:47:48Z","timestamp":1393559268000},"page":"167-185","source":"Crossref","is-referenced-by-count":18,"title":["On risk-averse maximum weighted subgraph problems"],"prefix":"10.1007","volume":"28","author":[{"given":"Maciej","family":"Rysz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Mirghorbani","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":[[2014,3,1]]},"reference":[{"issue":"4","key":"9718_CR1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1002\/net.10001","volume":"38","author":"YP Aneja","year":"2001","unstructured":"Aneja YP, Chandrasekaran R, Nair KPK (2001) Maximizing residual flow under an arc destruction. Networks 38(4):194\u2013198","journal-title":"Networks"},{"issue":"3","key":"9718_CR2","doi-asserted-by":"crossref","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. Math Financ 9(3):203\u2013228","journal-title":"Math Financ"},{"issue":"4","key":"9718_CR3","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/opre.1070.0428","volume":"55","author":"A Atamtk","year":"2007","unstructured":"Atamtk A, Zhang M (2007) Two-stage robust network flow and design under demand uncertainty. Oper Res 55(4):662\u2013673","journal-title":"Oper Res"},{"issue":"1","key":"9718_CR4","doi-asserted-by":"crossref","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":"2","key":"9718_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/0220012","volume":"20","author":"E Balas","year":"1991","unstructured":"Balas E, Xue J (1991) Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs. SIAM J. Comput. 20(2):209\u2013221","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9718_CR6","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas E, Yu CS (1986) Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4):1054\u20131068","journal-title":"SIAM J. Comput."},{"key":"9718_CR7","first-page":"1","volume":"50","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal A, Nemirovski A (1999) On polyhedral approximations of the second-order cone. Dimensions 50:1","journal-title":"Dimensions"},{"issue":"3","key":"9718_CR8","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s11590-009-0125-x","volume":"3","author":"VL Boginski","year":"2009","unstructured":"Boginski VL, Commander CW, Turko T (2009) Polynomial-time identification of robust network flows under uncertain arc failures. Optim Lett 3(3):461\u2013473","journal-title":"Optim Lett"},{"issue":"1","key":"9718_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.1070.0203","volume":"42","author":"AM Campbell","year":"2008","unstructured":"Campbell AM, Thomas BW (2008) Probabilistic traveling salesman problem with deadlines. Transp Sci 42(1):1\u201321","journal-title":"Transp Sci"},{"issue":"2","key":"9718_CR10","doi-asserted-by":"crossref","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. J Braz Comput Soc 18(2):137\u2013151","journal-title":"J Braz Comput Soc"},{"issue":"6","key":"9718_CR11","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan R, Pardalos PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9(6):375\u2013382","journal-title":"Oper Res Lett"},{"key":"9718_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-662-04790-3_1","volume-title":"Advances in Finance and Stochastics","author":"F Delbaen","year":"2002","unstructured":"Delbaen F (2002) Coherent risk measures on general probability spaces. In: Sandmann K, Schnbucher P (eds) Advances in Finance and Stochastics. Springer, Berlin, pp 1\u201337"},{"key":"9718_CR13","first-page":"17","volume":"5","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1960) On the evolution of random graphs. Publ Math Inst Hungary Acad Sci 5:17\u201361","journal-title":"Publ Math Inst Hungary Acad Sci"},{"issue":"1","key":"9718_CR14","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"RG Gallager","year":"1983","unstructured":"Gallager RG, Humblet PA, Spira PM (1983) A distributed algorithm for minimum-weight spanning trees. ACM Trans Progr Lang Syst 5(1):66\u201377","journal-title":"ACM Trans Progr Lang Syst"},{"issue":"2","key":"9718_CR15","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/opre.48.2.233.12384","volume":"48","author":"GD Glockner","year":"2000","unstructured":"Glockner GD, Nemhauser GL (2000) A dynamic network flow problem with uncertain arc capacities: formulation and problem structure. Oper Res 48(2):233\u2013242","journal-title":"Oper Res"},{"issue":"1","key":"9718_CR16","doi-asserted-by":"crossref","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. Oper Res 60(1):123\u2013127","journal-title":"Oper Res"},{"key":"9718_CR17","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":"2","key":"9718_CR18","first-page":"49","volume":"16","author":"P Krokhmal","year":"2011","unstructured":"Krokhmal P, Zabarankin M, Uryasev S (2011) Modeling and optimization of risk. Surv Oper Res Manag Sci 16(2):49\u201366","journal-title":"Surv Oper Res Manag Sci"},{"key":"9718_CR19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1080\/14697680701458307","volume":"7","author":"PA Krokhmal","year":"2007","unstructured":"Krokhmal PA (2007) Higher moment coherent risk measures. Quant Finance 7:373\u2013387","journal-title":"Quant Finance"},{"issue":"3","key":"9718_CR20","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.ejor.2009.03.053","volume":"201","author":"PA Krokhmal","year":"2010","unstructured":"Krokhmal PA, Soberanis P (2010) Risk optimization with p-order conic constraints: a linear programming ap proach. Eur J Oper Res 201(3):653\u2013671","journal-title":"Eur J Oper Res"},{"key":"9718_CR21","doi-asserted-by":"crossref","unstructured":"Kumlander D (2004) A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-colouring and a backtrack search. In: Topping BHV, Mota Soares CA, (eds) Proceedings of the 4th international conference on engineering computational technology, Civil-Comp Press, Stirlingshire, Paper 60. doi: 10.4203\/ccp.80.60","DOI":"10.4203\/ccp.80.60"},{"key":"9718_CR22","first-page":"165","volume-title":"Modelling, computation and optimization in information systems and management sciences, volume 14 of communications in computer and information science","author":"D Kumlander","year":"2008","unstructured":"Kumlander D (2008) On importance of a special sorting in the maximum-weight clique algorithm based on colour classes. In: Le Thi H, Bouvry P, Pham Dinh T (eds) Modelling, computation and optimization in information systems and management sciences, volume 14 of communications in computer and information science. Springer, Berlin, pp 165\u2013174"},{"key":"9718_CR23","doi-asserted-by":"crossref","unstructured":"Miao Z, Balasundaram B, Pasiliao E (2013) An exact algorithm for the maximum probabilistic clique problem. J Comb Optim. doi: 10.1007\/s10878-013-9699-4 .","DOI":"10.1007\/s10878-013-9699-4"},{"issue":"3","key":"9718_CR24","doi-asserted-by":"crossref","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-norm linear discrimination. Eur J Oper Res 231(3):784\u2013789","journal-title":"Eur J Oper Res"},{"issue":"4","key":"9718_CR25","first-page":"424","volume":"8","author":"PRJ \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd PRJ (2001) A new algorithm for the maximum-weight clique problem. Nordic J Comput 8(4):424\u2013436","journal-title":"Nordic J Comput"},{"key":"9718_CR26","doi-asserted-by":"crossref","unstructured":"\u00d6sterg\u00e5rd PRJ (2002) A fast algorithm for the maximum clique problem. Discret Appl Math 120(1\u20133): 197\u2013207 Special issue devoted to the 6th twente workshop on graphs and combinatorial optimization","DOI":"10.1016\/S0166-218X(01)00290-6"},{"key":"9718_CR27","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos PM, Xue J (1994) The maximum clique problem. J Glob Optim 4:301\u2013328","journal-title":"J Glob Optim"},{"issue":"1","key":"9718_CR28","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10878-011-9422-2","volume":"25","author":"A Sorokin","year":"2013","unstructured":"Sorokin A, Boginski V, Nahapetyan A, Pardalos P (2013) Computational risk management techniques for fixed charge network flow problems with uncertain arc failures. J Comb Optim 25(1):99\u2013122","journal-title":"J Comb Optim"},{"key":"9718_CR29","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","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: Rahman M, Fujita S (eds) WALCOM: algorithms and computation, vol 5942., Lecture notes in computer scienceSpringer, Berlin, pp 191\u2013203"},{"issue":"1","key":"9718_CR30","doi-asserted-by":"crossref","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. Comput Optim Appl 56(1):113\u2013130","journal-title":"Comput Optim Appl"},{"issue":"2\u20133","key":"9718_CR31","doi-asserted-by":"crossref","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. Comput Optim Appl 24(2\u20133):289\u2013333","journal-title":"Comput Optim Appl"},{"key":"9718_CR32","doi-asserted-by":"crossref","unstructured":"Vinel A , Krokhmal P (2013) On polyhedral approximations in p-order cone programming. (Working paper).","DOI":"10.1080\/10556788.2013.877905"},{"key":"9718_CR33","doi-asserted-by":"crossref","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, ACM Press, New York, pp 253\u2013264, 1978","DOI":"10.1145\/800133.804355"},{"key":"9718_CR34","unstructured":"Yezerska O, Butenko S , Boginski V (2013) Detecting robust cliques in the graphs subject to uncertain edge failures. (Working paper)."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9718-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9718-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9718-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:32:05Z","timestamp":1648427525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9718-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,1]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9718"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9718-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,1]]}}}