{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T04:03:17Z","timestamp":1777608197801,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2015,11,14]],"date-time":"2015-11-14T00:00:00Z","timestamp":1447459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,11,14]],"date-time":"2015-11-14T00:00:00Z","timestamp":1447459200000},"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-0103"],"award-info":[{"award-number":["FA9550-12-1-0103"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1404971"],"award-info":[{"award-number":["CMMI-1404971"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s11590-015-0971-7","type":"journal-article","created":{"date-parts":[[2015,11,14]],"date-time":"2015-11-14T07:46:29Z","timestamp":1447487189000},"page":"1947-1957","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts"],"prefix":"10.1007","volume":"12","author":[{"given":"Esmaeel","family":"Moradi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balabhaskar","family":"Balasundaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,14]]},"reference":[{"issue":"1","key":"971_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"RD Alba","year":"1973","unstructured":"Alba, R.D.: A graph-theoretic definition of a sociometric clique. J. Math. Sociol. 3(1), 113\u2013126 (1973)","journal-title":"J. Math. Sociol."},{"key":"971_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/net.21455","volume":"60","author":"MT Almeida","year":"2012","unstructured":"Almeida, M.T., Carvalho, F.D.: Integer models and upper bounds for the 3-club problem. Networks 60, 155\u2013166 (2012)","journal-title":"Networks"},{"issue":"3","key":"971_CR3","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.ejor.2013.08.004","volume":"232","author":"MT Almeida","year":"2014","unstructured":"Almeida, M.T., Carvalho, F.D.: An analytical comparison of the LP relaxations of integer models for the $$k$$-club problem. Eur. J. Oper. Res. 232(3), 489\u2013498 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"971_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0123007","volume":"23","author":"E Balas","year":"1972","unstructured":"Balas, E., Jeroslow, R.: Canonical cuts on the unit hypercube. SIAM J. Appl. Math. 23(1), 61\u201369 (1972)","journal-title":"SIAM J. Appl. Math."},{"key":"971_CR5","unstructured":"Balasundaram, B.: Graph theoretic generalizations of clique: optimization and extensions. PhD thesis, Texas A&M University, College Station, Texas, USA (2007)"},{"key":"971_CR6","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1007\/978-1-4419-7997-1_9","volume-title":"Handbook of Combinatorial Optimization","author":"Balabhaskar Balasundaram","year":"2013","unstructured":"Balasundaram, B., Mahdavi Pajouh, F.: Graph theoretic clique relaxations and applications. In: Pardalos, P.M., Du, D.Z., Graham, R. (eds.) Handbook of Combinatorial Optimization, 2nd edn, pp. 1559\u20131598. Springer, New York (2013)"},{"issue":"1","key":"971_CR7","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.: Novel approaches for analyzing biological networks. J. Comb. Optim. 10(1), 23\u201339 (2005)","journal-title":"J. Comb. Optim."},{"key":"971_CR8","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0305-0548(99)00047-7","volume":"27","author":"JM Bourjolly","year":"2000","unstructured":"Bourjolly, J.M., Laporte, G., Pesant, G.: Heuristics for finding $$k$$-clubs in an undirected graph. Comput. Oper. Res. 27, 559\u2013569 (2000)","journal-title":"Comput. Oper. Res."},{"key":"971_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0377-2217(01)00133-3","volume":"138","author":"JM Bourjolly","year":"2002","unstructured":"Bourjolly, J.M., Laporte, G., Pesant, G.: An exact algorithm for the maximum $$k$$-club problem in an undirected graph. Eur. J. Oper. Res. 138, 21\u201328 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"971_CR10","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.ejor.2010.11.023","volume":"210","author":"FD Carvalho","year":"2011","unstructured":"Carvalho, F.D., Almeida, M.T.: Upper bounds and heuristics for the 2-club problem. Eur. J. Oper. Res. 210(3), 489\u2013494 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"971_CR11","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.: Graph-based data mining. IEEE Intell. Syst. 15(2), 32\u201341 (2000)","journal-title":"IEEE Intell. Syst."},{"key":"971_CR12","unstructured":"Dimacs (2012) Graph partitioning and graph clustering: tenth Dimacs implementation challenge. \n                    http:\/\/www.cc.gatech.edu\/dimacs10\/index.shtml\n                    \n                  . Accessed Feb 2015"},{"key":"971_CR13","unstructured":"Gurobi Optimization, Inc (2014) Gurobi optimizer reference manual,version 6.0, copyright $$\\copyright $$ 2014. \n                    http:\/\/www.gurobi.com\/documentation\/6.0\/refman\/"},{"issue":"3","key":"971_CR14","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1002\/net.21620","volume":"67","author":"Sera Kahruman-Anderoglu","year":"2015","unstructured":"Kahruman-Anderoglu, S., Buchanan, A., Butenko, S., Prokopyev, O.: On provably best construction heuristics for hard combinatorial optimization problems. Networks. (2015). doi:\n                    10.1002\/net.21620","journal-title":"Networks"},{"key":"971_CR15","doi-asserted-by":"publisher","unstructured":"Miao, J., Berleant, D.: From paragraph networks to document networks. In: Proceedings of the International Conference on Information Technology: Coding and Computing, 2004 (ITCC 2004), vol. 1, pp 295\u2013302 (2004). doi:\n                    10.1109\/ITCC.2004.1286469","DOI":"10.1109\/ITCC.2004.1286469"},{"key":"971_CR16","doi-asserted-by":"crossref","unstructured":"Mirghorbani, M., Krokhmal, P.: On finding $$k$$-cliques in $$k$$-partite graphs. Optimization Letters. 7(6), 1155\u20131165 (2013)","DOI":"10.1007\/s11590-012-0536-y"},{"issue":"2","key":"971_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"RJ Mokken","year":"1979","unstructured":"Mokken, R.J.: Cliques, clubs and clans. Qual. Quant. 13(2), 161\u2013173 (1979)","journal-title":"Qual. Quant."},{"key":"971_CR18","unstructured":"Pajouh, F.M., Balasundaram, B.: On inclusionwise maximal and maximum cardinality $$k$$-clubs in graphs. Discret. Optim. 9(2), 84\u201397 (2012)"},{"key":"971_CR19","doi-asserted-by":"crossref","unstructured":"Pajouh, F.M., Balasundaram, B., Hicks, I.V.: On the 2-club polytope of graphs (2015, under review)","DOI":"10.1287\/opre.2016.1500"},{"key":"971_CR20","first-page":"143","volume-title":"Handbook of Optimization in Complex Networks","author":"Jeffrey Pattillo","year":"2011","unstructured":"Pattillo, J., Youssef, N., Butenko, S.: Clique relaxation models in social network analysis. In: Thai, M.T., Pardalos, P.M. (eds.) Handbook of Optimization in Complex Networks. Springer Optimization and Its Applications, vol. 58, pp 143\u2013162. Springer, New York (2012)"},{"issue":"5","key":"971_CR21","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s11590-011-0311-5","volume":"6","author":"A Sch\u00e4fer","year":"2012","unstructured":"Sch\u00e4fer, A., Komusiewicz, C., Moser, H., Niedermeier, R.: Parameterized computational complexity of finding small-diameter subgraphs. Optim. Lett. 6(5), 883\u2013891 (2012)","journal-title":"Optim. Lett."},{"key":"971_CR22","doi-asserted-by":"crossref","unstructured":"Shahinpour, S., Butenko, S.: Algorithms for the maximum $$k$$-club problem in graphs. J. Comb. Optim. 26(3), 520\u2013554 (2013a)","DOI":"10.1007\/s10878-012-9473-z"},{"key":"971_CR23","doi-asserted-by":"crossref","unstructured":"Shahinpour, S., Butenko, S.: Distance-based clique relaxations in networks: $$s$$-clique and $$s$$-club. In: Goldengorin, B.I., Kalyagin, V.A., Pardalos, P.M. (eds.) Models, Algorithms, and Technologies for Network Analysis, vol. 59, pp 149\u2013174. Springer New York (2013b)","DOI":"10.1007\/978-1-4614-8588-9_10"},{"issue":"21","key":"971_CR24","doi-asserted-by":"publisher","first-page":"12123","DOI":"10.1073\/pnas.2032324100","volume":"100","author":"V. Spirin","year":"2003","unstructured":"Spirin, V., Mirny, L.A.: Protein complexes and functional modules in molecular networks. Proc. Natl. Acad. Sci. 100(21), 12123\u201312128 (2003)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"971_CR25","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/310641.310644","volume":"6","author":"L Terveen","year":"1999","unstructured":"Terveen, L., Hill, W., Amento, B.: Constructing, organizing, and visualizing collections of topically related, web resources. ACM Trans. Comput. Hum. Interact. 6, 67\u201394 (1999)","journal-title":"ACM Trans. Comput. Hum. Interact."},{"issue":"2","key":"971_CR26","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ejor.2011.10.027","volume":"218","author":"A Veremyev","year":"2012","unstructured":"Veremyev, A., Boginski, V.: Identifying large robust network clusters via new compact formulations of maximum $$k$$-club problems. Eur. J. Oper. Res. 218(2), 316\u2013326 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"971_CR27","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1002\/net.21622","volume":"66","author":"Alexander Veremyev","year":"2015","unstructured":"Veremyev, A., Prokopyev, O.A., Pasiliao, E.L.: Critical nodes for distance-based connectivity and related problems in graphs. Networks 66(3), 170\u2013195 (2015)","journal-title":"Networks"},{"key":"971_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, New York (1994)"},{"key":"971_CR29","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC \u201978, pp. 253\u2013264. ACM Press, New York (1978)","DOI":"10.1145\/800133.804355"}],"updated-by":[{"DOI":"10.1007\/s11590-018-1273-7","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T00:00:00Z","timestamp":1528329600000}}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0971-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0971-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0971-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0971-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T17:48:32Z","timestamp":1589651312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0971-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,14]]},"references-count":29,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["971"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0971-7","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s11590-018-1273-7","asserted-by":"object"}]},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,14]]},"assertion":[{"value":"15 May 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2018","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This article provides an erratum to \u201cFinding a maximum <i>k<\/i>-club using the <i>k<\/i>-clique formulation and canonical hypercube cuts,\u201d published online in Optim Lett, 2015","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}