{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:33:41Z","timestamp":1761888821095,"version":"build-2065373602"},"reference-count":6,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s13675-012-0004-6","type":"journal-article","created":{"date-parts":[[2012,12,6]],"date-time":"2012-12-06T10:16:17Z","timestamp":1354788977000},"page":"71-80","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Strong and compact relaxations in the original space using a compact extended formulation"],"prefix":"10.1016","volume":"1","author":[{"given":"Mathieu","family":"Van Vyve","sequence":"first","affiliation":[]},{"given":"Laurence A.","family":"Wolsey","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-012-0004-6_CR1","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Numer Math"},{"key":"10.1007\/s13675-012-0004-6_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10288-010-0122-z","article-title":"Extended formulations in combinatorial optimization","volume":"8","author":"Conforti","year":"2010","journal-title":"4OR Q J Oper Res"},{"key":"10.1007\/s13675-012-0004-6_CR3","unstructured":"Christof T, Loebel A (1997) Porta\u2014a polyhedron representation transformation algorithm. Available at http:\/\/typo.zib.de\/opt-long-projects\/Software\/Porta\/"},{"key":"10.1007\/s13675-012-0004-6_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(93)90263-M","article-title":"Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems","volume":"71","author":"Rardin","year":"1993","journal-title":"Eur J Oper Res"},{"year":"1986","series-title":"Theory of linear and integer programming","author":"Schrijver","key":"10.1007\/s13675-012-0004-6_CR5"},{"key":"10.1007\/s13675-012-0004-6_CR6","doi-asserted-by":"crossref","unstructured":"Vanderbeck F, Wolsey LA (2010) Reformulation and decomposition of integer programs. In: J\u00fcnger M et al (eds) 50 Years of Integer Programming 1958\u20132008. Springer, Berlin, pp 431\u2013502","DOI":"10.1007\/978-3-540-68279-0_13"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-012-0004-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-012-0004-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000125?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000125?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-012-0004-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:02Z","timestamp":1761882362000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["S2192440621000125"],"URL":"https:\/\/doi.org\/10.1007\/s13675-012-0004-6","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Strong and compact relaxations in the original space using a compact extended formulation","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-012-0004-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 The Author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}