{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T10:42:41Z","timestamp":1779100961507,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0305-0548(00)00053-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:07:21Z","timestamp":1027616841000},"page":"13-31","source":"Crossref","is-referenced-by-count":26,"title":["Finding all k-cliques in k-partite graphs, an application in textile engineering"],"prefix":"10.1016","volume":"29","author":[{"given":"Tore","family":"Gr\u00fcnert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Irnich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-J\u00fcrgen","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkhard","family":"Wulfhorst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00053-8_BIB1","series-title":"Computers and Intractability. A Guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB2","unstructured":"Obolenski B, Pickett A. Final report to the BMBF-Project Composites with three-dimensional braided reinforcement. Aachen, 1996."},{"issue":"3","key":"10.1016\/S0305-0548(00)00053-8_BIB3","first-page":"88","article-title":"Novel three-dimensional braided structures with continuous transition between different cross-sectional forms","volume":"33","author":"Wulfhorst","year":"1996","journal-title":"Band- und Flechtindustrie"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB4","doi-asserted-by":"crossref","unstructured":"Bron C, Kerbosch J. Finding all cliques of an undirected graph. Communications of the ACM 1973;16(9): 575\u201377.","DOI":"10.1145\/362342.362367"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02248731","article-title":"Clique detection for nondirected graphs: two new algorithms","volume":"21","author":"Gerhards","year":"1979","journal-title":"Computing"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01589347","article-title":"A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles","volume":"20","author":"Hsu","year":"1981","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/S0305-0548(00)00053-8_BIB7","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","article-title":"Finding a maximum clique in an arbitrary graph","volume":"15","author":"Balas","year":"1986","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"10.1016\/S0305-0548(00)00053-8_BIB8","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0305-0548(90)90048-C","article-title":"TABARIS: an exact algorithm based on tabu search for finding a maximum independent set in a graph","volume":"17","author":"Friden","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01415983","article-title":"A branch and bound algorithm for the maximum clique problem","volume":"34","author":"Babel","year":"1990","journal-title":"ZOR \u2014 Methods and Models of Operations Research"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB10","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02257777","article-title":"Finding maximum cliques in arbitrary and in special graphs","volume":"46","author":"Babel","year":"1991","journal-title":"Computing"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB11","doi-asserted-by":"crossref","unstructured":"Mannino C, Sassano A. Edge projection and the maximum cardinality stable set problem. In: Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability, DIMACS series in discrete mathematics and theoretical computer science. Providence, RI: American Mathematical Society, 1996. p. 205\u201320.","DOI":"10.1090\/dimacs\/026\/11"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB12","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","article-title":"Vertex packings: structural properties and algorithms","volume":"8","author":"Nemhauser","year":"1975","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.1016\/S0305-0548(00)00053-8_BIB13","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1002\/nav.3800240203","article-title":"A node covering algorithm","volume":"24","author":"Balas","year":"1977","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB14","doi-asserted-by":"crossref","unstructured":"Balas E, Ceria S, Cornu\u00e9jols G, Pataki G. Polyhedral methods for the maximum clique problem. In: Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability, DIMACS series in discrete mathematics and theoretical computer science. Providence, RI: American Mathematical Society, 1996. p. 11\u201328.","DOI":"10.1090\/dimacs\/026\/02"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB15","doi-asserted-by":"crossref","unstructured":"Gibbons LE, Hearn DW, Pardalos PM. A continuous based heuristic for the maximum clique problem. In: Johnson DS, Trick MA, editors Cliques, coloring, and satisfiability, DIMACS series in discrete mathematics and theoretical computer science. Providence, RI: American Mathematical Society, 1996. p. 103\u2013124.","DOI":"10.1090\/dimacs\/026\/07"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB16","unstructured":"Bourjolly J-M, Gill P, Laporte G, Mercure H. An exact quadratic 0-1 algorithm for the stable set problem. In: Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability, DIMACS series in discrete mathematics and theoretical computer science. Providence, RI: American Mathematical Society, 1996. p. 53\u201374."},{"key":"10.1016\/S0305-0548(00)00053-8_BIB17","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\/S0305-0548(00)00053-8_BIB18","doi-asserted-by":"crossref","unstructured":"Soriano P, Gendreau M. Tabu search algorithms for the maximum clique problem. In: Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability, DIMACS series in discrete mathematics and theoretical computer science. Providence, RI: American Mathematical Society, 1996. p. 221\u201342.","DOI":"10.1090\/dimacs\/026\/12"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB19","doi-asserted-by":"crossref","unstructured":"Fleurent C, Ferland JA. Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. In: Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability, DIMACS series in discrete mathematics and theoretical computer science. Providence, RI: American Mathematical Society, 1996. p. 53\u201374.","DOI":"10.1090\/dimacs\/026\/29"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB20","doi-asserted-by":"crossref","unstructured":"Goldberg MK, Rivenburgh RD. Constructing cliques using restricted backtracking. In: Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability, DIMACS series in discrete mathematics and theoretical computer science. Providence, RI: American Mathematical Society, 1996. p. 89\u2013102.","DOI":"10.1090\/dimacs\/026\/06"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB21","doi-asserted-by":"crossref","unstructured":"Grossman T. Applying the INN model to the maximum clique problem. In: Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability, DIMACS series in discrete mathematics and theoretical computer science. Providence, RI: American Mathematical Society, 1996. p. 125\u201346.","DOI":"10.1090\/dimacs\/026\/08"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB22","doi-asserted-by":"crossref","unstructured":"Jagota A, Sanchis L, Ganesan R. Approximately solving maximum clique using neural network and related heuristics. In: Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability, DIMACS series in discrete mathematics and theoretical computer science. Providence, RI: American Mathematical Society, 1996. p. 169\u2013204.","DOI":"10.1090\/dimacs\/026\/10"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB23","doi-asserted-by":"crossref","unstructured":"Balas E, Niehaus W. Finding large cliques in arbitrary graphs by bipartite matching. In: Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability, DIMACS series in discrete mathematics and theoretical computer science. Providence, RI: American Mathematical Society, 1996. p. 29\u201352.","DOI":"10.1090\/dimacs\/026\/03"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB24","doi-asserted-by":"crossref","unstructured":"Homer S, Peinado M. Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs. In: Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability, DIMACS series in discrete mathematics and theoretical computer science. Providence, RI: American Mathematical Society, 1996, p. 147\u201368.","DOI":"10.1090\/dimacs\/026\/09"},{"key":"10.1016\/S0305-0548(00)00053-8_BIB25","series-title":"The C++ programming language","author":"Stroustrup","year":"1997"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000538?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000538?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T13:52:33Z","timestamp":1555768353000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0305054800000538"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00053-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}