{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:54:27Z","timestamp":1725458067947},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642321467"},{"type":"electronic","value":"9783642321474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32147-4_14","type":"book-chapter","created":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T11:54:50Z","timestamp":1341489290000},"page":"141-152","source":"Crossref","is-referenced-by-count":2,"title":["An Algebraic Approach to Symmetric Extended Formulations"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Braun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","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: A Quarterly Journal of Operations Research\u00a08(1), 1\u201348 (2010)","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Dixon, J.D., Mortimer, B.: Permutation groups. Springer (1996) ISBN 0387945997","DOI":"10.1007\/978-1-4612-0731-3"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1287\/moor.1090.0392","volume":"34","author":"Y. Faenza","year":"2009","unstructured":"Faenza, Y., Kaibel, V.: Extended formulations for packing and partitioning orbitopes. Mathematics of Operations Research\u00a034(3), 686\u2013697 (2009)","journal-title":"Mathematics of Operations Research"},{"key":"14_CR4","unstructured":"Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.: Combinatorial Bounds on Nonnegative Rank and Extended Formulations. Arxiv preprint arXiv:1111.0444 (2011)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds. Arxiv preprint arxiv:1111.0837 (2011)","DOI":"10.1145\/2213977.2213988"},{"key":"14_CR6","unstructured":"Goemans, M.X.: Smallest compact formulation for the permutahedron, preprint (2009)"},{"key":"14_CR7","unstructured":"Kaibel, V.: Extended formulations in combinatorial optimization. Arxiv preprint arXiv:1104.1023 (2011)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-20807-2_23","volume-title":"Integer Programming and Combinatoral Optimization","author":"V. Kaibel","year":"2011","unstructured":"Kaibel, V., Pashkovich, K.: Constructing Extended Formulations from Reflection Relations. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol.\u00a06655, pp. 287\u2013300. Springer, Heidelberg (2011)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-13036-6_11","volume-title":"Integer Programming and Combinatorial Optimization","author":"V. Kaibel","year":"2010","unstructured":"Kaibel, V., Pashkovich, K., Theis, D.O.: Symmetry Matters for the Sizes of Extended Formulations. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 135\u2013148. Springer, Heidelberg (2010)"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.disopt.2006.12.003","volume":"5","author":"M. K\u00f6ppe","year":"2008","unstructured":"K\u00f6ppe, M., Louveaux, Q., Weismantel, R.: Intermediate integer programming representations using value disjunctions. Discrete Optimization\u00a05(2), 293\u2013313 (2008)","journal-title":"Discrete Optimization"},{"key":"14_CR11","unstructured":"Pashkovich, K.: Symmetry in Extended Formulations of the Permutahedron. Arxiv preprint arXiv:0912.3446 (2009)"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","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. Journal of Computer and System Sciences\u00a043(3), 441\u2013466 (1991)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32147-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:56:00Z","timestamp":1620129360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32147-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321467","9783642321474"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32147-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}