{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:10:39Z","timestamp":1725793839683},"publisher-location":"Cham","reference-count":11,"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_27","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T11:50:30Z","timestamp":1400327430000},"page":"321-332","source":"Crossref","is-referenced-by-count":8,"title":["Lower Bounds on the Sizes of Integer Programs without Additional Variables"],"prefix":"10.1007","author":[{"given":"Volker","family":"Kaibel","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Weltge","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","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: STOC, pp. 95\u2013106 (2012)","DOI":"10.1145\/2213977.2213988"},{"key":"27_CR2","unstructured":"Gavish, B., Graves, S.C.: The travelling salesman problem and related problems. Technical report, Operations Research Center, Massachusetts Institute of Technology (1978)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Goemans, M.: Smallest compact formulation for the permutahedron. Kaibel, V., Thomas, R. (eds.) To appear in a forthcoming issue of Mathematical Programming, Series B \u201cLifts of Convex Sets\u201d (2014)","DOI":"10.1007\/s10107-014-0757-1"},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0012-365X(75)90003-5","volume":"11","author":"R. Jeroslow","year":"1975","unstructured":"Jeroslow, R.: On defining sets of vertices of the hypercube by linear inequalities. Discrete Mathematics\u00a011(2), 119\u2013124 (1975)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"27_CR5","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1287\/ijoc.1060.0178","volume":"19","author":"J. Lee","year":"2007","unstructured":"Lee, J., Margot, F.: On a binary-encoded ilp coloring formulation. INFORMS Journal on Computing\u00a019(3), 406\u2013415 (2007)","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"27_CR6","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."},{"issue":"4","key":"27_CR7","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C.E. Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM\u00a07(4), 326\u2013329 (1960)","journal-title":"J. ACM"},{"key":"27_CR8","volume-title":"Geometrie der Zahlen","author":"H. Minkowski","year":"1896","unstructured":"Minkowski, H.: Geometrie der Zahlen. Teubner Verlag, Leipzig (1896)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/jlms\/s1-27.1.1","volume":"27","author":"R. Rado","year":"1952","unstructured":"Rado, R.: An inequality. J. London Math. Soc.\u00a027, 1\u20136 (1952)","journal-title":"J. London Math. Soc."},{"key":"27_CR10","unstructured":"Schrijver, A.: Combinatorial Optimization \u2013 Polyhedra and Efficiency. Springer (2003)"},{"key":"27_CR11","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons, Inc., New York (1986)"}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:23:28Z","timestamp":1558905808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}