{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:11:01Z","timestamp":1726513861309},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,5]],"date-time":"2014-01-05T00:00:00Z","timestamp":1388880000000},"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-013-9699-4","type":"journal-article","created":{"date-parts":[[2014,1,4]],"date-time":"2014-01-04T06:21:03Z","timestamp":1388816463000},"page":"105-120","source":"Crossref","is-referenced-by-count":10,"title":["An exact algorithm for the maximum probabilistic clique problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Zhuqi","family":"Miao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balabhaskar","family":"Balasundaram","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,1,5]]},"reference":[{"key":"9699_CR1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s10107-005-0638-8","volume":"106","author":"S Ahmed","year":"2006","unstructured":"Ahmed S (2006) Convexity and decomposition of mean-risk stochastic programs. Math Progr 106:433\u2013446","journal-title":"Math Progr"},{"key":"9699_CR2","volume-title":"Tutorials in operations research","author":"S Ahmed","year":"2008","unstructured":"Ahmed S, Shapiro A (2008) Solving chance-constrained stochastic programs via sampling and integer programming. In: Chen ZL, Raghavan S (eds) Tutorials in operations research, 10th edn. INFORMS, Minneapolis","edition":"10"},{"key":"9699_CR3","unstructured":"Applegate D, Johnson DS (1988) dfmax.c [C program], available online. ftp:\/\/dimacs.rutgers.edu\/pub\/challenge\/graph\/solvers\/dfmax.c"},{"key":"9699_CR4","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01955041","volume":"15","author":"E Balas","year":"1996","unstructured":"Balas E, Xue J (1996) Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Algorithmica 15:397\u2013412","journal-title":"Algorithmica"},{"key":"9699_CR5","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas E, Yu C (1986) Finding a maximum clique in an arbitrary graph. SIAM J Comput 15:1054\u20131068","journal-title":"SIAM J Comput"},{"key":"9699_CR6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/9780470253489.ch6","volume-title":"Analysis of biological networks","author":"B Balasundaram","year":"2008","unstructured":"Balasundaram B, Butenko S (2008) Network clustering. In: Junker BH, Schreiber F (eds) Analysis of biological networks. Wiley, New York, pp 113\u2013138"},{"key":"9699_CR7","doi-asserted-by":"crossref","unstructured":"Balasundaram B, Pajouh FM (2013) Graph theoretic clique relaxations and applications. In: Pardalos PM, Du DZ, Graham R (eds) Handbook of combinatorial optimization, 2nd edn. Springer. doi: 10.1007\/978-1-4419-7997-1_9","DOI":"10.1007\/978-1-4419-7997-1_9"},{"key":"9699_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10878-011-9426-y","volume":"26","author":"M Batsyn","year":"2013","unstructured":"Batsyn M, Goldengorin B, Maslov E, Pardalos P (2013) Improvements to mcs algorithm for the maximum clique problem. J Comb Optim 26:1\u201320. doi: 10.1007\/s10878-012-9592-6","journal-title":"J Comb Optim"},{"issue":"3","key":"9699_CR9","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464\u2013501","journal-title":"SIAM Rev"},{"key":"9699_CR10","doi-asserted-by":"crossref","unstructured":"Boginski V (2011) Network-based data mining: operations research techniques and applications. In: Encyclopedia of operations research and management science, Wiley, New York","DOI":"10.1002\/9780470400531.eorms0565"},{"key":"9699_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of combinatorial optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization. Kluwer Academic, Dordrecht, pp 1\u201374"},{"key":"9699_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2005.05.026","volume":"173","author":"S Butenko","year":"2006","unstructured":"Butenko S, Wilhelm W (2006) Clique-detection models in computational biochemistry and genomics. Eur J Oper Res 173:1\u201317","journal-title":"Eur J Oper Res"},{"key":"9699_CR13","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 P (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9:375\u2013382","journal-title":"Oper Res Lett"},{"issue":"2","key":"9699_CR14","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"DJ Cook","year":"2000","unstructured":"Cook DJ, Holder LB (2000) Graph-based data mining. IEEE Intell Syst 15(2):32\u201341","journal-title":"IEEE Intell Syst"},{"key":"9699_CR15","unstructured":"DIMACS (1995) Cliques, coloring, and satisfiability: second dimacs implementation challenge. http:\/\/dimacs.rutgers.edu\/Challenges\/"},{"key":"9699_CR16","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, New York"},{"key":"9699_CR17","doi-asserted-by":"crossref","first-page":"205","DOI":"10.2307\/2785673","volume":"20","author":"F Harary","year":"1957","unstructured":"Harary F, Ross IC (1957) A procedure for clique detection using the group matrix. Sociometry 20:205\u2013215","journal-title":"Sociometry"},{"key":"9699_CR18","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad J (1999) Clique is hard to approximate within $$n^{1-\\epsilon }$$ n 1 - \u03f5 . Acta Math 182:105\u2013142","journal-title":"Acta Math"},{"key":"9699_CR19","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, Shmoys DB (1985) A best possible heuristic for the $$k$$ k -center problem. Math Oper Res 10:180\u2013184","journal-title":"Math Oper Res"},{"key":"9699_CR20","doi-asserted-by":"crossref","unstructured":"Johnson D, Trick M (eds) (1996) Cliques, coloring, and satisfiablility: second dimacs implementation challenge, DIMACS series in discrete mathematics and theoretical computer science, vol 26. American Mathematical Society, Providence","DOI":"10.1090\/dimacs\/026"},{"key":"9699_CR21","doi-asserted-by":"crossref","unstructured":"Krokhmal P, Uryasev S, Zrazhevsky G (2005) Numerical comparison of conditional value-at-risk and conditional drawdown-at-risk approaches: application to hedge funds. In: Applications of stochastic programming, MPS\/SIAM Ser. Optim., vol 5, SIAM, Philadelphia, pp 609\u2013631","DOI":"10.1137\/1.9780898718799.ch29"},{"key":"9699_CR22","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/352","volume-title":"Graph colorings","author":"M Kubale","year":"2004","unstructured":"Kubale M (2004) Graph colorings, 352nd edn. American Mathematical Society, Providence","edition":"352"},{"issue":"2","key":"9699_CR23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce RD, Perry AD (1949) A method of matrix analysis of group structure. Psychometrika 14(2):95\u2013116","journal-title":"Psychometrika"},{"key":"9699_CR24","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-642-13036-6_21","volume-title":"Integer programming and combinatorial optimization, lecture notes in computer science","author":"J Luedtke","year":"2010","unstructured":"Luedtke J (2010) An integer programming and decomposition approach to general chance-constrained mathematical programs. In: Eisenbrand F, Shepherd F (eds) Integer programming and combinatorial optimization, lecture notes in computer science, vol 6080. Springer, Berlin \/ Heidelberg, pp 271\u2013284"},{"issue":"2","key":"9699_CR25","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1137\/070702928","volume":"19","author":"J Luedtke","year":"2008","unstructured":"Luedtke J, Ahmed S (2008) A sample approximation approach for optimization with probabilistic constraints. SIAM J Optim 19(2):674\u2013699","journal-title":"SIAM J Optim"},{"key":"9699_CR26","doi-asserted-by":"crossref","unstructured":"McClosky B (2011) Clique relaxations. In: Encyclopedia of operations research and management science, Wiley, New York","DOI":"10.1002\/9780470400531.eorms0145"},{"key":"9699_CR27","unstructured":"Nemirovski A, Shapiro A (2004) Scenario approximations of chance constraints. In: Probabilistic and randomized methods for design under uncertainty, Springer, Heidelberg, pp 3\u201348"},{"key":"9699_CR28","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1137\/050622328","volume":"17","author":"A Nemirovski","year":"2006","unstructured":"Nemirovski A, Shapiro A (2006a) Convex approximations of chance constrained programs. SIAM J Optim 17:969\u2013996","journal-title":"SIAM J Optim"},{"key":"9699_CR29","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/1-84628-095-8_1","volume-title":"Probabilistic and randomized methods for design under uncertainty","author":"A Nemirovski","year":"2006","unstructured":"Nemirovski A, Shapiro A (2006b) Scenario approximations of chance constraints. In: Calafiore G, Dabbene F (eds) Probabilistic and randomized methods for design under uncertainty. Springer, London, pp 3\u201347"},{"key":"9699_CR30","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd PRJ (2002) A fast algorithm for the maximum clique problem. Discrete Appl Math 120:197\u2013207","journal-title":"Discrete Appl Math"},{"key":"9699_CR31","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"BK Pagnoncelli","year":"2009","unstructured":"Pagnoncelli BK, Ahmed S, Shapiro A (2009) Sample average approximation method for chance constrained programming: theory and applications. J Optim Theory Appl 142:399\u2013416","journal-title":"J Optim Theory Appl"},{"key":"9699_CR32","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"},{"key":"9699_CR33","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-1-4614-0857-4_5","volume-title":"Handbook of optimization in complex networks, springer optimization and its applications","author":"J Pattillo","year":"2012","unstructured":"Pattillo J, Youssef N, Butenko S (2012) Clique relaxation models in social network analysis. In: Thai MT, Pardalos PM (eds) Handbook of optimization in complex networks, springer optimization and its applications, vol 58. Springer, New York, pp 143\u2013162"},{"key":"9699_CR34","first-page":"267","volume-title":"Stochastic programming, handbooks in operations research and management","author":"A Pr\u00e9kopa","year":"2003","unstructured":"Pr\u00e9kopa A (2003) Probabilistic programming. In: Ruszczynski A, Shapiro A (eds) Stochastic programming, handbooks in operations research and management, vol 10. Elsevier, Salt Lake, pp 267\u2013351"},{"issue":"3","key":"9699_CR35","doi-asserted-by":"crossref","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"R Rockafellar","year":"2000","unstructured":"Rockafellar R, Uryasev S (2000) Optimization of conditional value-at-risk. J Risk 2(3):21\u201341","journal-title":"J Risk"},{"issue":"4","key":"9699_CR36","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/ijoc.10.4.438","volume":"10","author":"EC Sewell","year":"1998","unstructured":"Sewell EC (1998) A branch and bound algorithm for the stability number of a sparse graph. INFORMS J Comput 10(4):438\u2013447","journal-title":"INFORMS J Comput"},{"key":"9699_CR37","doi-asserted-by":"crossref","unstructured":"Shapiro A, Dentcheva D, Ruszczynski A (eds) (2009) Lectures on stochastic programming: modeling and theory. Society for Industrial and Applied Mathematics (SIAM): MPS\/SIAM series on optimization, Philadelphia","DOI":"10.1137\/1.9780898718751"},{"issue":"1","key":"9699_CR38","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2007","unstructured":"Tomita E, Kameda T (2007) An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J Glob Optim 37(1):95\u2013111","journal-title":"J Glob Optim"},{"key":"9699_CR39","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-642-11440-3_18","volume-title":"WALCOM: algorithms and computation, lecture notes in computer science","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, lecture notes in computer science, vol 5942. Springer, Berlin Heidelberg, pp 191\u2013203"},{"issue":"1","key":"9699_CR40","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"},{"key":"9699_CR41","unstructured":"Vaskelainen V (2010) Russian doll search algorithms for discrete optimization problems. PhD thesis, Helsinki University of Technology"},{"key":"9699_CR42","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis. Cambridge University Press, New York"},{"issue":"5","key":"9699_CR43","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0167-6377(97)00054-0","volume":"21","author":"DR Wood","year":"1997","unstructured":"Wood DR (1997) An algorithm for finding a maximum clique in a graph. Oper Res Lett 21(5):211\u2013217","journal-title":"Oper Res Lett"},{"key":"9699_CR44","doi-asserted-by":"crossref","unstructured":"Yannakakis M (1978) Node-and edge-deletion NP-complete problems. STOC \u201978 In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing. ACM Press, New York, pp 253\u2013264","DOI":"10.1145\/800133.804355"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9699-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9699-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9699-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T17:33:07Z","timestamp":1565026387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9699-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,5]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9699"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9699-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,5]]}}}