{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T12:08:43Z","timestamp":1751285323028},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6529,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0166-218x(94)00151-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"167-191","source":"Crossref","is-referenced-by-count":12,"title":["Some new classes of facets for the equicut polytope"],"prefix":"10.1016","volume":"62","author":[{"given":"C.C.","family":"de Souza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Laurent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00151-3_BIB1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(88)90144-5","article-title":"A polynomial algorithm for line-graph partitioning","volume":"26","author":"Arbib","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(94)00151-3_BIB2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","article-title":"On the cut polytope","volume":"36","author":"Barahona","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)00151-3_BIB3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/moor.18.1.245","article-title":"Cut polytopes, Boolean quadric polytopes and non-negative quadratic pseudo-Boolean functions","volume":"18","author":"Boros","year":"1993","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(94)00151-3_BIB4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01588778","article-title":"The equipartition polytope I","volume":"49","author":"Conforti","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)00151-3_BIB5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01588779","article-title":"The equipartition polytope II","volume":"49","author":"Conforti","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)00151-3_BIB6","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0167-6377(90)90029-5","article-title":"Lifting facets of the cut polytope","volume":"9","author":"De Simone","year":"1990","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(94)00151-3_BIB7","article-title":"The graph equipartition problem: optimal solutions, extensions and applications","author":"de Souza","year":"1993"},{"key":"10.1016\/0166-218X(94)00151-3_BIB8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(93)90115-A","article-title":"The inequicut cone","volume":"119","author":"Deza","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)00151-3_BIB9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01580897","article-title":"Facets for the cut cone I","volume":"56","author":"Deza","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)00151-3_BIB10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01580898","article-title":"Facets for the cut cone II: clique-web inequalities","volume":"56","author":"Deza","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)00151-3_BIB11","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(94)00151-3_BIB12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Systems Tech. J."},{"issue":"3","key":"10.1016\/0166-218X(94)00151-3_BIB13","article-title":"Un algoritmo polinomial para el problema de la equiparticion sobre un grafo serie-paralelo","volume":"XVII","author":"Liebling","year":"1992","journal-title":"Politecnica"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94001513?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94001513?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T03:55:42Z","timestamp":1555300542000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94001513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["0166218X94001513"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00151-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}