{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:17Z","timestamp":1763467997985},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130359"},{"type":"electronic","value":"9783642130366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13036-6_11","type":"book-chapter","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:36:09Z","timestamp":1276000569000},"page":"135-148","source":"Crossref","is-referenced-by-count":22,"title":["Symmetry Matters for the Sizes of Extended Formulations"],"prefix":"10.1007","author":[{"given":"Volker","family":"Kaibel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanstantsin","family":"Pashkovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk Oliver","family":"Theis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach.\u00a042(4), 844\u2013856 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods\u00a06(3), 466\u2013486 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/BF01444035","volume":"33","author":"A. Bochert","year":"1889","unstructured":"Bochert, A.: Ueber die Zahl der verschiedenen Werthe, die eine Function gegebener Buchstaben durch Vertauschung derselben erlangen kann. Math. Ann.\u00a033(4), 584\u2013590 (1889)","journal-title":"Math. Ann."},{"issue":"9","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1016\/j.dam.2005.05.036","volume":"154","author":"M. Bruglieri","year":"2006","unstructured":"Bruglieri, M., Ehrgott, M., Hamacher, H.W., Maffioli, F.: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discrete Appl. Math.\u00a0154(9), 1344\u20131357 (2006)","journal-title":"Discrete Appl. Math."},{"unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Extended formulations in combinatorial optimization. Tech. Rep., Universit\u00e0 di Padova (2009)","key":"11_CR5"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. Standards Sect. B\u00a069B, 125\u2013130 (1965)","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Programming\u00a01, 127\u2013136 (1971)","journal-title":"Math. Programming"},{"issue":"3","key":"11_CR8","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with O(1) worst case access time. J. Assoc. Comput. Mach.\u00a031(3), 538\u2013544 (1984)","journal-title":"J. Assoc. Comput. Mach."},{"unstructured":"Goemans, M.: Smallest compact formulation for the permutahedron, \n                  \n                    http:\/\/www-math.mit.edu\/~goemans\/publ.html","key":"11_CR9"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Indust. Appl. Math.\u00a010, 196\u2013210 (1962)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-642-13036-6_14","volume-title":"IPCO 2010","author":"V. Kaibel","year":"2010","unstructured":"Kaibel, V., Loos, A.: Branched polyhedral systems. In: Eisenbrand, F., Shepherd, B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 177\u2013190. Springer, Heidelberg (2010)"},{"unstructured":"Kaibel, V., Pashkovich, K., Theis, D.O.: Symmetry matters for the sizes of extended formulations. arXiv:0911.3712v1 [math.CO]","key":"11_CR12"},{"unstructured":"Kipp Martin, R.: Using separation algorithms to generate mixed integer model reformulations. Tech. Rep., University of Chicago (1987)","key":"11_CR13"},{"unstructured":"Pashkovich, K.: Tight lower bounds on the sizes of symmetric extensions of permutahedra and similar results (in preparation)","key":"11_CR14"},{"issue":"5","key":"11_CR15","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1137\/0219054","volume":"19","author":"J.P. Schmidt","year":"1990","unstructured":"Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious k-probe hash functions. SIAM J. Comput.\u00a019(5), 775\u2013786 (1990)","journal-title":"SIAM J. Comput."},{"key":"11_CR16","volume-title":"Finite permutation groups. Translated from the German by Bercov, R.","author":"H. Wielandt","year":"1964","unstructured":"Wielandt, H.: Finite permutation groups. Translated from the German by Bercov, R. Academic Press, New York (1964)"},{"issue":"3","key":"11_CR17","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. J. Comput. System Sci.\u00a043(3), 441\u2013466 (1991)","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13036-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:51:56Z","timestamp":1619783516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13036-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130359","9783642130366"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13036-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}