{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T01:37:33Z","timestamp":1769305053490,"version":"3.49.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":[[2002,2]]},"DOI":"10.1016\/s0167-6377(01)00106-7","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T23:55:37Z","timestamp":1034639737000},"page":"57-65","source":"Crossref","is-referenced-by-count":21,"title":["Compact vs. exponential-size LP relaxations"],"prefix":"10.1016","volume":"30","author":[{"given":"Robert D.","family":"Carr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Lancia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00106-7_BIB1","series-title":"Network Flows: Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0167-6377(01)00106-7_BIB2","unstructured":"R. Carr, G. Lancia, S. Istrail, On the integer programming approach to independent set problems with applications to protein structure alignment, Sandia Natl. Labs Technical Report, SAND2000-2171, 2000."},{"key":"10.1016\/S0167-6377(01)00106-7_BIB3","series-title":"Combinatorial Optimization","author":"Cook","year":"1998"},{"key":"10.1016\/S0167-6377(01)00106-7_BIB4","unstructured":"M. Fischetti, G. Lancia, P. Serafini, A Branch-and-Price algorithm for minimum routing cost trees, IX SIAM Conference on Discrete Mathematics, Toronto, 1998 (also, submitted for publication as \u201cExact Algorithms for Minimum Routing Cost Trees\u201d, Networks, 2000)."},{"key":"10.1016\/S0167-6377(01)00106-7_BIB5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0167-6377(01)00106-7_BIB6","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0203015","article-title":"Optimum communication spanning trees","volume":"3","author":"Hu","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(01)00106-7_BIB7","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1089\/cmb.1998.5.517","article-title":"A polyhedral approach to RNA sequence structure alignment","volume":"5","author":"Lenhof","year":"1998","journal-title":"J. Combin. Biol."},{"key":"10.1016\/S0167-6377(01)00106-7_BIB8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","article-title":"Using separation algorithms to generate mixed integer model reformulations","volume":"10","author":"Martin","year":"1991","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(01)00106-7_BIB9","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"issue":"3","key":"10.1016\/S0167-6377(01)00106-7_BIB10","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/S009753979732253X","article-title":"A Polynomial-time approximation scheme for minimum routing cost spanning trees","volume":"29","author":"Wu","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(01)00106-7_BIB11","doi-asserted-by":"crossref","unstructured":"M. Yannakakis, Expressing Combinatorial Optimization Problems by Linear Programs, Journal of Computer and System Sciences, Vol. 43, No. 3, pp. 441\u2013466, 1991.","DOI":"10.1016\/0022-0000(91)90024-Y"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701001067?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701001067?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T07:25:47Z","timestamp":1556868347000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701001067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0167637701001067"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00106-7","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}