{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T06:21:52Z","timestamp":1778739712863,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"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":[[2004,4]]},"DOI":"10.1016\/s0377-2217(02)00852-4","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T09:55:35Z","timestamp":1048586135000},"page":"57-70","source":"Crossref","is-referenced-by-count":29,"title":["New facets and a branch-and-cut algorithm for the weighted clique problem"],"prefix":"10.1016","volume":"154","author":[{"given":"Michael M.","family":"S\u00f8rensen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00852-4_BIB1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(93)90097-7","article-title":"A cutting-plane approach to the edge-weighted maximal clique problem","volume":"69","author":"Dijkhuizen","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB2","series-title":"Operations Research \u201993","first-page":"157","article-title":"LP-relaxations for the edge-weighted subclique problem","author":"Faigle","year":"1994"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01589097","article-title":"A cutting plane algorithm for a clustering problem","volume":"45","author":"Gr\u00f6tschel","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB4","unstructured":"M. Hunting, Relaxation Techniques for Discrete Optimization Problems\u2013\u2013Theory and Algorithms, Ph.D. thesis, University of Twente, 1998"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0377-2217(99)00449-X","article-title":"A Lagrangian relaxation approach to the edge-weighted clique problem","volume":"131","author":"Hunting","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","article-title":"Min-cut clustering","volume":"62","author":"Johnson","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB7","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/S0377-2217(99)00262-3","article-title":"The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations","volume":"123","author":"Macambira","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0166-218X(97)00039-5","article-title":"Cardinality constrained Boolean quadratic polytope","volume":"79","author":"Mehrotra","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","article-title":"The Boolean quadric polytope: Some characteristics, facets and relatives","volume":"45","author":"Padberg","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB10","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/0377-2217(95)00299-5","article-title":"An extended formulation approach to the edge-weighted maximal clique problem","volume":"95","author":"Park","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB11","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0167-6377(94)00065-E","article-title":"A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope","volume":"17","author":"Sherali","year":"1995","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB12","unstructured":"M.M. S\u00f8rensen, b-Tree facets for the simple graph partitioning polytope, Working paper 00-4, Department of Management Science and Logistics, The Aarhus School of Business, 2000"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB13","unstructured":"M.M. S\u00f8rensen, New facets and a branch-and-cut algorithm for the weighted clique problem, Working paper 01-2, Department of Management Science and Logistics, The Aarhus School of Business, 2001(Available at www.asb.dk\/~mim\/papers.htm)"},{"key":"10.1016\/S0377-2217(02)00852-4_BIB14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01918201","article-title":"Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs","volume":"29","author":"Sp\u00e4th","year":"1985","journal-title":"Zeitschrift f\u00fcr Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008524?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008524?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T13:53:05Z","timestamp":1553435585000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702008524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0377221702008524"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00852-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}