{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T07:27:41Z","timestamp":1785310061605,"version":"3.55.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T00:00:00Z","timestamp":1409270400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s11590-014-0782-2","type":"journal-article","created":{"date-parts":[[2014,8,28]],"date-time":"2014-08-28T00:26:42Z","timestamp":1409185602000},"page":"615-633","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["An integer programming approach for finding the most and the least central cliques"],"prefix":"10.1007","volume":"9","author":[{"given":"Chrysafis","family":"Vogiatzis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Veremyev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eduardo L.","family":"Pasiliao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,8,29]]},"reference":[{"key":"782_CR1","unstructured":"COLOR02\/03\/04: Graph coloring and its generalizations. http:\/\/mat.gsia.cmu.edu\/COLOR03\/ (2013). Accessed 9 Sept 2013"},{"key":"782_CR2","doi-asserted-by":"crossref","unstructured":"Abello, J., Pardalos, P.M., Resende, M.G.C.: On maximum clique problems in very large graphs. In: Proceedings of External Memory Algorithms, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 50, pp. 119\u2013130. American Mathematical Society, Washington DC (1999)","DOI":"10.1090\/dimacs\/050\/06"},{"issue":"4","key":"782_CR3","doi-asserted-by":"crossref","first-page":"041306","DOI":"10.1103\/PhysRevE.86.041306","volume":"86","author":"DS Bassett","year":"2012","unstructured":"Bassett, D.S., Owens, E.T., Daniels, K.E., Porter, M.A.: Influence of network topology on sound propagation in granular materials. Phys. Rev. E 86(4), 041306 (2012)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"782_CR4","doi-asserted-by":"crossref","first-page":"16","DOI":"10.17730\/humo.7.3.f4033344851gl053","volume":"7","author":"A Bavelas","year":"1948","unstructured":"Bavelas, A.: A mathematical model for group structures. Hum. Organ. 7(3), 16\u201330 (1948)","journal-title":"Hum. Organ."},{"issue":"6","key":"782_CR5","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1121\/1.1906679","volume":"22","author":"A Bavelas","year":"1950","unstructured":"Bavelas, A.: Communication patterns in task-oriented groups. J. Acoust. Soc. Am. 22(6), 725\u2013730 (1950)","journal-title":"J. Acoust. Soc. Am."},{"issue":"11","key":"782_CR6","doi-asserted-by":"crossref","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.: Mining market data: a network approach. Comput. Oper. Res. 33(11), 3171\u20133184 (2006). doi: 10.1016\/j.cor.2005.01.027","journal-title":"Comput. Oper. Res."},{"key":"782_CR7","unstructured":"Boldi, P., Vigna, S.: Axioms for centrality. arXiv preprint arXiv:1308.2140 (2013)"},{"key":"782_CR8","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Handbook of Combinatorial Optimization, pp. 1\u201374. Kluwer Academic Publishers, Dordrecht (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"issue":"4","key":"782_CR9","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/j.socnet.2005.11.005","volume":"28","author":"SP Borgatti","year":"2006","unstructured":"Borgatti, S.P., Everett, M.G.: A graph-theoretic perspective on centrality. Soc. Netw. 28(4), 466\u2013484 (2006)","journal-title":"Soc. Netw."},{"issue":"1","key":"782_CR10","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.E.: Clique-detection models in computational biochemistry and genomics. Eur. J. Oper. Res. 173(1), 1\u201317 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"782_CR11","first-page":"1","volume":"38","author":"T Davis","year":"2011","unstructured":"Davis, T., Hu, Y.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"782_CR12","unstructured":"DIMACS: 10th DIMACS implementation challenge. Available at http:\/\/www.cc.gatech.edu\/dimacs10\/index.shtml . Accessed Sept 2013 (2011)"},{"issue":"20","key":"782_CR13","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1016\/j.ipl.2009.07.019","volume":"109","author":"S Dolev","year":"2009","unstructured":"Dolev, S., Elovici, Y., Puzis, R., Zilberman, P.: Incremental deployment of network monitors based on group betweenness centrality. Inf. Process. Lett. 109(20), 1172\u20131176 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"782_CR14","doi-asserted-by":"crossref","first-page":"066103","DOI":"10.1103\/PhysRevE.85.066103","volume":"85","author":"m Ercsey-Ravasz","year":"2012","unstructured":"Ercsey-Ravasz, m, Lichtenwalter, R.N., Chawla, N.V., Toroczkai, Z.: Range-limited centrality measures in complex networks. Phys. Rev. E 85(6), 066103 (2012)","journal-title":"Phys. Rev. E"},{"key":"782_CR15","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. Publicationes Mathematicae Debrecen 6, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae Debrecen"},{"issue":"9","key":"782_CR16","doi-asserted-by":"crossref","first-page":"3373","DOI":"10.1016\/j.laa.2011.11.032","volume":"436","author":"E Estrada","year":"2012","unstructured":"Estrada, E.: Path Laplacian matrices: introduction and application to the analysis of consensus in networks. Linear Algebra Appl. 436(9), 3373\u20133391 (2012)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"782_CR17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1080\/0022250X.1999.9990219","volume":"23","author":"MG Everett","year":"1999","unstructured":"Everett, M.G., Borgatti, S.P.: The centrality of groups and classes. J. Math. Sociol. 23(3), 181\u2013201 (1999)","journal-title":"J. Math. Sociol."},{"issue":"1","key":"782_CR18","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1017\/CBO9780511811395.004","volume":"35","author":"MG Everett","year":"2005","unstructured":"Everett, M.G., Borgatti, S.P.: Extending centrality. Models Methods Soc. Netw. Anal. 35(1), 57\u201376 (2005)","journal-title":"Models Methods Soc. Netw. Anal."},{"key":"782_CR19","doi-asserted-by":"crossref","unstructured":"Fink, M., Spoerhase, J.: Maximum betweenness centrality: approximability and tractable cases. In: Proceedings of WALCOM: Algorithms and Computation, pp. 9\u201320. Springer, New York (2011)","DOI":"10.1007\/978-3-642-19094-0_4"},{"issue":"6","key":"782_CR20","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"key":"782_CR21","doi-asserted-by":"crossref","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry. 22(1), 35\u201341 (1977)","DOI":"10.2307\/3033543"},{"issue":"3","key":"782_CR22","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1979","unstructured":"Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215\u2013239 (1979)","journal-title":"Soc. Netw."},{"issue":"4","key":"782_CR23","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S1093-3263(97)00089-2","volume":"15","author":"EJ Gardiner","year":"1997","unstructured":"Gardiner, E.J., Artymiuk, P.J., Willett, P.: Clique-detection algorithms for matching three-dimensional molecular structures. J. Mol. Graph. Model. 15(4), 245\u2013253 (1997)","journal-title":"J. Mol. Graph. Model."},{"key":"782_CR24","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman and Co., New York (1979)"},{"key":"782_CR25","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult D.A., swart, P.J.: Exploring network structure, dynamics, and function using networkx. In: Varoquaux, G., Vaught, T., Millman, J (eds) Proceedings of the 7th Python in Science Conference (SciPy2008), pp. 1\u201315. Pasadena, USA (2008)","DOI":"10.25080\/TCWV9851"},{"issue":"1","key":"782_CR26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0378-8733(94)00248-9","volume":"17","author":"P Hage","year":"1995","unstructured":"Hage, P., Harary, F.: Eccentricity and centrality in networks. Soc. Netw. 17(1), 57\u201363 (1995)","journal-title":"Soc. Netw."},{"issue":"3","key":"782_CR27","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.socnet.2009.02.003","volume":"31","author":"ED Kolaczyk","year":"2009","unstructured":"Kolaczyk, E.D., Chua, D.B., Barth\u00e9lemy, M.: Group betweenness and co-betweenness: Inter-related notions of coalition centrality. Soc. Netw. 31(3), 190\u2013203 (2009)","journal-title":"Soc. Netw."},{"key":"782_CR28","doi-asserted-by":"crossref","unstructured":"Kosch\u00fctzki, D., Lehmann, K.A., Peeters, L., Richter, S., Tenfelde-Podehl, D., Zlotowski, O.: Centrality indices. In: Proceedings of Network Analysis, pp. 16\u201361. Springer, New York (2005)","DOI":"10.1007\/978-3-540-31955-9_3"},{"key":"782_CR29","unstructured":"Krebs, V.: Uncloaking terrorist networks. First Monday 7(4) (2002). Available at http:\/\/journals.uic.edu\/ojs\/index.php\/fm\/article\/view\/941 . Accessed 9 Sept 2013"},{"issue":"1","key":"782_CR30","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1037\/h0057189","volume":"46","author":"HJ Leavitt","year":"1951","unstructured":"Leavitt, H.J.: Some effects of certain communication patterns on group performance. J. Abnorm. Soc. Psychol. 46(1), 38 (1951)","journal-title":"J. Abnorm. Soc. Psychol."},{"issue":"2","key":"782_CR31","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce, R.D., Perry, A.D.: A method of matrix analysis of group structure. Psychometrika 14(2), 95\u2013116 (1949)","journal-title":"Psychometrika"},{"issue":"4","key":"782_CR32","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau, D., Schneider, K., Boisseau, O., Haase, P., Slooten, E., Dawson, S.: The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4), 396\u2013405 (2003). doi: 10.1007\/s00265-003-0651-y","journal-title":"Behav. Ecol. Sociobiol."},{"key":"782_CR33","doi-asserted-by":"crossref","unstructured":"Pagani, G.A., Aiello, M.: The Power Grid as a complex network: A survey. Physica A: Statistical Mechanics and its Applications, 392(11), 2688\u20132700 (2013)","DOI":"10.1016\/j.physa.2013.01.023"},{"issue":"4","key":"782_CR34","first-page":"287","volume":"20","author":"R Puzis","year":"2007","unstructured":"Puzis, R., Elovici, Y., Dolev, S.: Finding the most prominent group in complex networks. AI Commun. 20(4), 287\u2013296 (2007)","journal-title":"AI Commun."},{"issue":"1","key":"782_CR35","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1108\/10662240910927821","volume":"19","author":"R Puzis","year":"2009","unstructured":"Puzis, R., Yagil, D., Elovici, Y., Braha, D.: Collaborative attack on internet users\u2019 anonymity. Internet Res. 19(1), 60\u201377 (2009)","journal-title":"Internet Res."},{"key":"782_CR36","unstructured":"Reka, A., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47\u201397 (2002). http:\/\/arxiv.org\/abs\/cond-mat\/0106096"},{"issue":"4","key":"782_CR37","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi, G.: The centrality index of a graph. Psychometrika 31(4), 581\u2013603 (1966)","journal-title":"Psychometrika"},{"issue":"1\u20132","key":"782_CR38","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/prca.201200068","volume":"7","author":"J Wang","year":"2013","unstructured":"Wang, J., Peng, W., Wu, F.X.: Computational approaches to predicting essential proteins: a survey. PROTEOMICS Clin. Appl. 7(1\u20132), 181\u2013192 (2013)","journal-title":"PROTEOMICS Clin. Appl."},{"key":"782_CR39","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"W Zachary","year":"1977","unstructured":"Zachary, W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452\u2013473 (1977)","journal-title":"J. Anthropol. Res."},{"issue":"1","key":"782_CR40","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.ejor.2012.10.021","volume":"226","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Youssef, N., Butenko, S.: On clique relaxation models in network analysis. Eur. J. Oper. Res. 226(1), 9\u201318 (2013)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0782-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0782-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0782-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T11:06:44Z","timestamp":1746356804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0782-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,29]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["782"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0782-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,29]]}}}