{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T05:33:16Z","timestamp":1781328796116,"version":"3.54.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0377-2217(01)00133-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:56:01Z","timestamp":1034596561000},"page":"21-28","source":"Crossref","is-referenced-by-count":83,"title":["An exact algorithm for the maximum k-club problem in an undirected graph"],"prefix":"10.1016","volume":"138","author":[{"given":"Jean-Marie","family":"Bourjolly","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gilles","family":"Pesant","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00133-3_BIB1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","article-title":"A graph-theoretic definition of a sociometric clique","volume":"3","author":"Alba","year":"1973","journal-title":"Journal of Mathematical Sociology"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB2","first-page":"39","article-title":"Taking stock of network analysis: A decade's result","volume":"1","author":"Alba","year":"1982","journal-title":"Research in the Sociology of Organizations"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/0022250X.1986.9990011","article-title":"Market networks and corporate behavior","volume":"12","author":"Baker","year":"1986","journal-title":"American Journal of Mathematical Sociology"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB4","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0305-0548(99)00047-7","article-title":"Heuristics for finding k-clubs in an undirected graph","volume":"27","author":"Bourjolly","year":"2000","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB5","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","article-title":"Finding all cliques of an undirected graph","volume":"16","author":"Bron","year":"1973","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: Shortest path","volume":"5","author":"Floyd","year":"1965","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB8","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02023002","article-title":"Solving the maximum clique problem using a tabu search approach","volume":"41","author":"Gendreau","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB9","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society, Providence, RI, 1996","DOI":"10.1090\/dimacs\/026"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB10","doi-asserted-by":"crossref","first-page":"851","DOI":"10.2307\/2095083","article-title":"Interlocking directorates and interest group formation","volume":"46","author":"Mintz","year":"1981","journal-title":"American Sociological Review"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00139635","article-title":"Cliques, clubs and clans","volume":"13","author":"Mokken","year":"1979","journal-title":"Quality and Quantity"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB12","doi-asserted-by":"crossref","unstructured":"A. Ronert, A dynamization of the all pairs least cost path problem, in: Proceedings of STACS'85, Lecture Notes in Computer Science, vol. 182, Springer, Berlin, 1985, pp. 279\u2013286","DOI":"10.1007\/BFb0024016"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB13","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1086\/226902","article-title":"Structural position in the world system and economic growth, 1955\u20131970: A multiple-network analysis of transactional interactions","volume":"84","author":"Snyder","year":"1979","journal-title":"American Journal of Sociology"},{"key":"10.1016\/S0377-2217(01)00133-3_BIB14","unstructured":"UCINET, Release 3.0, Mathematical Social Science Group, Social School of Social Sciences, University of California at Irvine"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701001333?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701001333?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T09:21:57Z","timestamp":1578475317000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701001333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0377221701001333"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00133-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}