{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T10:05:44Z","timestamp":1775729144790,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,3,16]],"date-time":"2012-03-16T00:00:00Z","timestamp":1331856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s00454-012-9421-9","type":"journal-article","created":{"date-parts":[[2012,3,15]],"date-time":"2012-03-15T15:12:54Z","timestamp":1331824374000},"page":"658-668","source":"Crossref","is-referenced-by-count":40,"title":["Extended Formulations for Polygons"],"prefix":"10.1007","volume":"48","author":[{"given":"Samuel","family":"Fiorini","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Rothvo\u00df","sequence":"additional","affiliation":[]},{"given":"Hans Raj","family":"Tiwary","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,16]]},"reference":[{"key":"9421_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/800061.808726","volume-title":"Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC\u201983","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An O(nlogn) sorting network. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC\u201983, pp. 1\u20139. ACM, New York (1983)"},{"issue":"2","key":"9421_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/moor.26.2.193.10561","volume":"26","author":"A. Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: On polyhedral approximations of the second-order cone. Math. Oper. Res. 26(2), 193\u2013205 (2001)","journal-title":"Math. Oper. Res."},{"key":"9421_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0024-3795(93)90224-C","volume":"190","author":"J.E. Cohen","year":"1993","unstructured":"Cohen, J.E., Rothblum, U.G.: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices. Linear Algebra Appl. 190, 149\u2013168 (1993)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"9421_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10288-010-0122-z","volume":"8","author":"M. Conforti","year":"2010","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Extended formulations in combinatorial optimization. 4OR 8(1), 1\u201348 (2010)","journal-title":"4OR"},{"key":"9421_CR5","unstructured":"Conforti, M., Faenza, Y., Fiorini, S., Grappe, R., Tiwary, H.R.: Extended formulations, non-negative factorizations and randomized communication protocols. http:\/\/arxiv.org\/abs\/1105.4127 (2011)"},{"key":"9421_CR6","unstructured":"Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.O.: Combinatorial bounds on nonnegative rank and extended formulations. Working paper (2011)"},{"key":"9421_CR7","unstructured":"Goemans, M.: Smallest compact formulation for the permutahedron. http:\/\/math.mit.edu\/~goemans\/PAPERS\/permutahedron.pdf (2009)"},{"key":"9421_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1210-2","volume-title":"Diophantine Geometry: An Introduction","author":"M. Hindry","year":"2000","unstructured":"Hindry, M., Silverman, J.H.: Diophantine Geometry: An Introduction, 1st edn. Springer, Berlin (2000)","edition":"1"},{"key":"9421_CR9","volume-title":"Algebra. Graduate Texts in Mathematics","author":"T.W. Hungerford","year":"1974","unstructured":"Hungerford, T.W.: Algebra. Graduate Texts in Mathematics. Springer, New York (1974)"},{"key":"9421_CR10","first-page":"2","volume":"85","author":"V. Kaibel","year":"2011","unstructured":"Kaibel, V.: Extended formulations in combinatorial optimization. Optima 85, 2\u20137 (2011)","journal-title":"Optima"},{"key":"9421_CR11","volume-title":"Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization","author":"V. Kaibel","year":"2011","unstructured":"Kaibel, V., Pashkovich, K.: Constructing extended formulations from reflection relations. In: Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (2011, to appear)"},{"key":"9421_CR12","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0041-0","volume-title":"Algebra","author":"S. Lang","year":"2002","unstructured":"Lang, S.: Algebra, Graduate Texts in Mathematics. Springer, Berlin (2002)"},{"issue":"3","key":"9421_CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"R.K. Martin","year":"1991","unstructured":"Martin, R.K.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10(3), 119\u2013128 (1991)","journal-title":"Oper. Res. Lett."},{"key":"9421_CR14","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T.: Some 0\/1 polytopes need exponential size extended formulations. http:\/\/arxiv.org\/abs\/1105.0036 (2011)","DOI":"10.1007\/s10107-012-0574-3"},{"key":"9421_CR15","series-title":"Chapman & Hall\/CRC Mathematics","volume-title":"Galois Theory","author":"I. Stewart","year":"2004","unstructured":"Stewart, I.: Galois Theory, 3rd edn. Chapman & Hall\/CRC Mathematics. Chapman & Hall\/CRC, Boca Raton (2004)","edition":"3"},{"key":"9421_CR16","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/978-3-540-68279-0_13","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"F. Vanderbeck","year":"2010","unstructured":"Vanderbeck, F., Wolsey, L.A.: Reformulation and decomposition of integer programs. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 431\u2013502. Springer, Berlin (2010)"},{"issue":"3","key":"9421_CR17","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M. Yannakakis","year":"1991","unstructured":"Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43(3), 441\u2013466 (1991)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9421-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-012-9421-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9421-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T09:32:45Z","timestamp":1561455165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-012-9421-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,16]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9421"],"URL":"https:\/\/doi.org\/10.1007\/s00454-012-9421-9","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,16]]}}}