{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:15:15Z","timestamp":1648559715579},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":[[2003,8]]},"DOI":"10.1016\/s0377-2217(02)00472-1","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"65-76","source":"Crossref","is-referenced-by-count":2,"title":["On identifying dominant cliques"],"prefix":"10.1016","volume":"149","author":[{"given":"L.F.","family":"Escudero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Mu\u00f1oz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0377-2217(02)00472-1_BIB1","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","article-title":"Conflict graphs in solving integer programming problems","volume":"121","author":"Atamt\u00fcrk","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00472-1_BIB2","unstructured":"R.E. Bixby, S. Ceria, C.M. McZeal, M.W.P. Savelsbergh, An updated mixed integer programming library: MIPLIB 3.0, Technical Report TR98-03, Department of Computational and Applied Mathematics, Rice University, 1998 (Downloadable from website http:\/\/www.caam.rice.edu\/~bixby\/miplib\/miplib.html)"},{"issue":"3","key":"10.1016\/S0377-2217(02)00472-1_BIB3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1287\/opre.46.3.355","article-title":"Solving a truck dispatching scheduling problem using branch-and-cut","volume":"46","author":"Bixby","year":"1998","journal-title":"Operations Research"},{"issue":"9","key":"10.1016\/S0377-2217(02)00472-1_BIB4","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"},{"issue":"6","key":"10.1016\/S0377-2217(02)00472-1_BIB5","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","article-title":"An exact algorithm for the maximum clique problem","volume":"9","author":"Carraghan","year":"1990","journal-title":"Operations Research Letters"},{"issue":"5","key":"10.1016\/S0377-2217(02)00472-1_BIB6","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large-scale zero-one linear programming problems","volume":"31","author":"Crowder","year":"1983","journal-title":"Operations Research"},{"issue":"2,3","key":"10.1016\/S0377-2217(02)00472-1_BIB7","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(93)90044-O","article-title":"Efficient reformulation for 0-1 programs\u2013\u2013methods and computational results","volume":"42","author":"Dietrich","year":"1993","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10.1016\/S0377-2217(02)00472-1_BIB8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02574740","article-title":"O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates","volume":"1","author":"Dietrich","year":"1993","journal-title":"Top"},{"issue":"1","key":"10.1016\/S0377-2217(02)00472-1_BIB9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF02568605","article-title":"On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs","volume":"4","author":"Escudero","year":"1996","journal-title":"Top"},{"key":"10.1016\/S0377-2217(02)00472-1_BIB10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1018973511339","article-title":"On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems","volume":"81","author":"Escudero","year":"1998","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(02)00472-1_BIB11","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/S0377-2217(98)00349-X","article-title":"On characterizing tighter formulations for 0-1 programs","volume":"106","author":"Escudero","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00472-1_BIB12","series-title":"Graphs and Algorithms","author":"Gondran","year":"1984"},{"issue":"1","key":"10.1016\/S0377-2217(02)00472-1_BIB13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.29.1.49","article-title":"Logical reduction methods in zero-one programming. Minimal preferred variables","volume":"29","author":"Guignard","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00472-1_BIB14","unstructured":"ILOG CPLEX 7.0\u2013\u2013User\u2019s Manual, France, 2000"},{"issue":"1","key":"10.1016\/S0377-2217(02)00472-1_BIB15","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","article-title":"Progress in linear programming-based algorithms for integer programming: An exposition","volume":"12","author":"Johnson","year":"2000","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/S0377-2217(02)00472-1_BIB16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02574809","article-title":"A correction of the justification of the Dietrich-Escudero-Gar\u0131\u0301n-P\u00e9rez O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates","volume":"3","author":"Mu\u00f1oz","year":"1995","journal-title":"Top"},{"key":"10.1016\/S0377-2217(02)00472-1_BIB17","unstructured":"S. Mu\u00f1oz, Reforzamiento de Modelos en Programaci\u00f3n Lineal 0-1, Ph.D. Thesis, Departamento de Estad\u0131\u0301stica e Investigaci\u00f3n Operativa I, Universidad Complutense de Madrid, 1999"},{"key":"10.1016\/S0377-2217(02)00472-1_BIB18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of set packing polyhedra","volume":"5","author":"Padberg","year":"1973","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/S0377-2217(02)00472-1_BIB19","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","article-title":"Preprocessing and probing techniques for mixed integer programming problems","volume":"6","author":"Savelsbergh","year":"1994","journal-title":"ORSA Journal on Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004721?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004721?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:29:50Z","timestamp":1553930990000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702004721"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0377221702004721"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00472-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}