{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T06:54:07Z","timestamp":1768632847772,"version":"3.49.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0167-6377(99)00029-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"235-243","source":"Crossref","is-referenced-by-count":15,"title":["Lifting theorems and facet characterization for a class of clique partitioning inequalities"],"prefix":"10.1016","volume":"24","author":[{"given":"Hans-J\u00fcrgen","family":"Bandelt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"Oosten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeroen H.G.C.","family":"Rutten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C.R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(99)00029-2_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01581239","article-title":"The partition problem","volume":"59","author":"Chopra","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(99)00029-2_BIB2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/(SICI)1097-0037(199712)30:4<263::AID-NET4>3.0.CO;2-H","article-title":"The polytope of block diagonal matrices and complete bipartite partitionings","volume":"30","author":"Crama","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(99)00029-2_BIB3","first-page":"109","article-title":"A cutting plane algorithm for optimal graph partitioning","volume":"57","author":"Faigle","year":"1987","journal-title":"Meth. Oper. Res."},{"key":"10.1016\/S0167-6377(99)00029-2_BIB4","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580870","article-title":"Facets of the clique partitioning polytope","volume":"47","author":"Gr\u00f6tschel","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(99)00029-2_BIB5","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, Y. Wakabayashi, Composition of facets of the clique partitioning polytope, in: R. Bodendiek, R. Henn (Eds.), Topics in Combinatorics and Graph Theory, Physica-Verlag, Heidelberg, 1990, pp. 271\u2013284.","DOI":"10.1007\/978-3-642-46908-4_31"},{"key":"10.1016\/S0167-6377(99)00029-2_BIB6","first-page":"113","article-title":"Chromatic number of hypergraphs and linear algebra","volume":"11","author":"Lov\u00e1sz","year":"1976","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"key":"10.1016\/S0167-6377(99)00029-2_BIB7","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.","DOI":"10.1002\/9781118627372"},{"key":"10.1016\/S0167-6377(99)00029-2_BIB8","unstructured":"M. Oosten, J.H.G.C. Rutten, F.C.R. Spieksma, The facial structure of the clique partitioning polytope, Report M 95-09, University of Limburg, The Netherlands, 1995."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000292?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000292?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:55:06Z","timestamp":1555577706000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637799000292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0167637799000292"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(99)00029-2","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}