{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:10:33Z","timestamp":1725793833267},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075563"},{"type":"electronic","value":"9783319075570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07557-0_26","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T07:50:30Z","timestamp":1400313030000},"page":"309-320","source":"Crossref","is-referenced-by-count":0,"title":["Simple Extensions of Polytopes"],"prefix":"10.1007","author":[{"given":"Volker","family":"Kaibel","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Walter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-39206-1_6","volume-title":"Automata, Languages, and Programming","author":"D. Avis","year":"2013","unstructured":"Avis, D., Tiwary, H.R.: On the extension complexity of combinatorial polytopes. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol.\u00a07965, pp. 57\u201368. Springer, Heidelberg (2013)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton landmarks in mathematics and physics. Princeton University Press (1963)","DOI":"10.7249\/R366"},{"key":"26_CR3","unstructured":"Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.O.: Combinatorial bounds on nonnegative rank and extended formulations. arXiv:1111.0444 (2011) (to appear in: Discrete Math.)"},{"key":"26_CR4","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. In: Karloff, H.J., Pitassi, T. (eds.) STOC, pp. 95\u2013106. ACM (2012)","DOI":"10.1145\/2213977.2213988"},{"key":"26_CR5","unstructured":"Gallo, G., Sodini, C.: Extreme points and adjacency relationship in the flow polytope. Calcolo\u00a015, 277\u2013288 (1978), 10.1007\/BF02575918"},{"key":"26_CR6","unstructured":"Gillmann, R.: 0\/1-Polytopes Typical and Extremal Properties. PhD thesis, Technische Universit\u00e4t, Berlin (2007)"},{"key":"26_CR7","unstructured":"Goemans, M.: Smallest compact formulation for the permutahedron (2009), \n                  \n                    http:\/\/www-math.mit.edu\/~goemans\/publ.html"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1137\/110839813","volume":"26","author":"V. Kaibel","year":"2012","unstructured":"Kaibel, V., Pashkovich, K., Theis, D.O.: Symmetry matters for sizes of extended formulations. SIAM J. Disc. Math.\u00a026(3), 1361\u20131382 (2012)","journal-title":"SIAM J. Disc. Math."},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"R. Kipp Martin","year":"1991","unstructured":"Kipp Martin, R.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett.\u00a010(3), 119\u2013128 (1991)","journal-title":"Oper. Res. Lett."},{"key":"26_CR10","unstructured":"Padberg, M.W., Rao, M.R.: The travelling salesman problem and a class of polyhedra of diameter two. Math. Program.\u00a07, 32\u201345 (1974), 10.1007\/BF01585502"},{"key":"26_CR11","unstructured":"Pashkovich, K.: Symmetry in extended formulations of the permutahedron (2009)"},{"issue":"4","key":"26_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.orl.2013.03.010","volume":"41","author":"S. Pokutta","year":"2013","unstructured":"Pokutta, S., Van Vyve, M.: A note on the extension complexity of the knapsack polytope. Oper. Res. Lett.\u00a041(4), 347\u2013350 (2013)","journal-title":"Oper. Res. Lett."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T.: Some 0\/1 polytopes need exponential size extended formulations. Math. Program, 1\u201314 (2012)","DOI":"10.1007\/s10107-012-0574-3"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T.: The matching polytope has exponential extension complexity. arXiv:1311.2369 (November 2013)","DOI":"10.1145\/2591796.2591834"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"383","DOI":"10.4007\/annals.2012.176.1.7","volume":"176","author":"F. Santos","year":"2012","unstructured":"Santos, F.: A counterexample to the hirsch conjecture. Annals of Mathematics. Second Series\u00a0176(1), 383\u2013412 (2012)","journal-title":"Annals of Mathematics. Second Series"},{"issue":"3","key":"26_CR16","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. Syst. Sci.\u00a043(3), 441\u2013466 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR17","unstructured":"Ziegler, G.M.: Lectures on Polytopes (Graduate Texts in Mathematics). Springer (2001)"}],"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-319-07557-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T17:11:33Z","timestamp":1558890693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}