{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:15:52Z","timestamp":1776122152034,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T00:00:00Z","timestamp":1459209600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/MAT\/04561\/2013"],"award-info":[{"award-number":["UID\/MAT\/04561\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10878-016-0009-9","type":"journal-article","created":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T18:35:27Z","timestamp":1459276527000},"page":"814-846","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The triangle k-club problem"],"prefix":"10.1007","volume":"33","author":[{"given":"Filipa D.","family":"Carvalho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Teresa","family":"Almeida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"RD Alba","year":"1973","unstructured":"Alba RD (1973) A graph-theoretic definition of a sociometric clique. J Mater Sociol 3:113\u2013126","journal-title":"J Mater Sociol"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1287\/opre.1080.0606","volume":"56","author":"DL Alderson","year":"2008","unstructured":"Alderson DL (2008) Catching the \u201cnetwork science\u201d bug: insight and opportunity for the operations researcher. Oper Res 56:1047\u20131065","journal-title":"Oper Res"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/net.21455","volume":"60","author":"MT Almeida","year":"2012","unstructured":"Almeida MT, Carvalho FD (2012) Integer models and upper bounds for the 3-club problem. Networks 60:155\u2013166","journal-title":"Networks"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.ejor.2013.08.004","volume":"232","author":"MT Almeida","year":"2014","unstructured":"Almeida MT, Carvalho FD (2014) An analytical comparison of the LP relaxations of integer models for the $$k$$ k -club problem. Eur J Oper Res 232:489\u2013498","journal-title":"Eur J Oper Res"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10479-005-3969-1","volume":"140","author":"E Balas","year":"2005","unstructured":"Balas E (2005) Projection, lifting and extended formulation in integer and combinatorial optimization. Ann Oper Res 140:125\u2013161","journal-title":"Ann Oper Res"},{"key":"9_CR6","doi-asserted-by":"crossref","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. J Comb Optim 10:23\u201339","journal-title":"J Comb Optim"},{"key":"9_CR7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B Balasundaram","year":"2011","unstructured":"Balasundaram B, Butenko S, Hicks IV (2011) Clique relaxations in social network analysis: the maximum $$k$$ k -plex problem. Oper Res 59:133\u2013142","journal-title":"Oper Res"},{"issue":"2","key":"9_CR8","first-page":"47","volume":"21","author":"V Batagelj","year":"1998","unstructured":"Batagelj V, Mrvar A (1998) Pajek: a program for large network analysis. Connections 21(2):47\u201357","journal-title":"Connections"},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/j.ejor.2003.10.054","volume":"161","author":"J Bla\u017cewicz","year":"2005","unstructured":"Bla\u017cewicz J, Formanowicz P, Kasprak M (2005) Selected combinatorial problems of computational biology. Eur J Oper Res 161:585\u2013597","journal-title":"Eur J Oper Res"},{"key":"9_CR10","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 PM (2006) Mining market data: a network approach. Comput Oper Res 33:3171\u20133184","journal-title":"Comput Oper Res"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0305-0548(99)00047-7","volume":"27","author":"J-M Bourjolly","year":"2000","unstructured":"Bourjolly J-M, Laporte G, Pesant G (2000) Heuristics for finding $$k$$ k -clubs in an undirected graph. Comput Oper Res 27:559\u2013569","journal-title":"Comput Oper Res"},{"key":"9_CR12","doi-asserted-by":"crossref","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-$$ k - club problem in an undirected graph. Eur J Oper Res 138:21\u201328","journal-title":"Eur J Oper Res"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.ejor.2010.11.023","volume":"210","author":"FD Carvalho","year":"2011","unstructured":"Carvalho FD, Almeida MT (2011) Upper bounds and heuristics for the 2-club problem. Eur J Oper Res 210:489\u2013494","journal-title":"Eur J Oper Res"},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/j.jretconser.2007.02.003","volume":"14","author":"L Cavique","year":"2007","unstructured":"Cavique L (2007) A scalable algorithm for the market basket analysis. J Retail Consum Serv 14:400\u2013407","journal-title":"J Retail Consum Serv"},{"key":"9_CR15","volume-title":"Graph theory. Graduate texts in mathematics, 173","author":"R Diestel","year":"2006","unstructured":"Diestel R (2006) Graph theory. Graduate texts in mathematics, 173. Springer, New York"},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"RD Luce","year":"1950","unstructured":"Luce RD (1950) Connectivity and generalized cliques in sociometric group structure. Psychometrika 15:169\u2013190","journal-title":"Psychometrika"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.disopt.2012.02.002","volume":"9","author":"F Mahdavi Pajouh","year":"2012","unstructured":"Mahdavi Pajouh F, Balasundaram B (2012) On inclusionwise maximal and maximum cardinality $$k$$ k -clubs in graphs. Discret Optim 9:84\u201397","journal-title":"Discret Optim"},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"RJ Mokken","year":"1979","unstructured":"Mokken RJ (1979) Cliques, clubs and clans. Qual Quant 13:161\u2013173","journal-title":"Qual Quant"},{"key":"9_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-015-0971-7","author":"E Moradi","year":"2015","unstructured":"Moradi E, Balasundaram B (2015) Finding a maximum $$k$$ k -club using the $$k$$ k -clique formulation and canonical hypercube cuts. Optim Lett. doi: 10.1007\/s11590-015-0971-7","journal-title":"Optim Lett"},{"key":"9_CR20","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167\u2013256","journal-title":"SIAM Rev"},{"key":"9_CR22","doi-asserted-by":"crossref","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 (2013a) On the maximum quasi-clique problem. Discret Appl Math 161:244\u2013257","journal-title":"Discret Appl Math"},{"key":"9_CR23","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 (2013b) On clique relaxation models in network analysis. Eur J Oper Res 226:9\u201318","journal-title":"Eur J Oper Res"},{"key":"9_CR24","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.ejor.2011.10.027","volume":"218","author":"A Veremyev","year":"2012","unstructured":"Veremyev A, Boginski V (2012) Identifying large robust network clusters via new compact formulations of maximum $$k$$ k -club problems. Eur J Oper Res 218:316\u2013326","journal-title":"Eur J Oper Res"},{"key":"9_CR25","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1002\/net.21622","volume":"66","author":"A Veremyev","year":"2015","unstructured":"Veremyev A, Prokopyev O, Pasiliao E (2015) Critical nodes for distance-based connectivity and related problems in graphs. Networks 66:170\u2013195","journal-title":"Networks"},{"key":"9_CR26","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"},{"key":"9_CR27","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393:440\u2013442","journal-title":"Nature"},{"key":"9_CR28","unstructured":"Wotzlaw A (2014) On solving the maximum $$k$$ k -club problem. arXiv:1403.5111v2"},{"key":"9_CR29","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu Q, Hao J-K (2015) A review on algorithms for maximum clique problems. Eur J Oper Res 242:693\u2013709","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0009-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0009-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0009-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0009-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:28Z","timestamp":1559262208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0009-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,29]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["9"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0009-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,29]]}}}