{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T04:30:22Z","timestamp":1716352222828},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"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":[[2004,1]]},"DOI":"10.1016\/s0166-218x(03)00337-8","type":"journal-article","created":{"date-parts":[[2003,7,31]],"date-time":"2003-07-31T22:28:16Z","timestamp":1059690496000},"page":"193-212","source":"Crossref","is-referenced-by-count":10,"title":["Lift and project relaxations for the matching and related polytopes"],"prefix":"10.1016","volume":"134","author":[{"given":"N\u00e9stor E.","family":"Aguilera","sequence":"first","affiliation":[]},{"given":"Silvia M.","family":"Bianchi","sequence":"additional","affiliation":[]},{"given":"Graciela L.","family":"Nasini","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00337-8_BIB1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane algorithm for mixed 0\u20131 programs","volume":"58","author":"Balas","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(03)00337-8_BIB2","doi-asserted-by":"crossref","unstructured":"M.L. Balinski, On maximum matching, minimum covering and their connections, in: H. Kuhn (Ed.), Proceedings of the Princeton Symposium on Mathematical Programming, 1970, pp. 303\u2013312.","DOI":"10.1515\/9781400869930-015"},{"key":"10.1016\/S0166-218X(03)00337-8_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0,1 vertices","volume":"69 B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bureau Standards"},{"issue":"4","key":"10.1016\/S0166-218X(03)00337-8_BIB4","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1287\/moor.26.4.796.10012","article-title":"When does the positive semidefiniteness constraint help in lifting procedures?","volume":"26","author":"Goemans","year":"2001","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(03)00337-8_BIB5","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","article-title":"Cones of matrices and set-functions and 0\u20131 optimization","volume":"1","author":"Lov\u00e1sz","year":"1991","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0166-218X(03)00337-8_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.24.1.1","article-title":"On a representation of the matching polytope via semidefinite liftings","volume":"24","author":"Stephen","year":"1999","journal-title":"Math. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003378?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003378?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T21:09:20Z","timestamp":1585084160000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03003378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0166218X03003378"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00337-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}