{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T21:42:49Z","timestamp":1708033369977},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T00:00:00Z","timestamp":1308355200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10107-011-0474-y","type":"journal-article","created":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T22:44:57Z","timestamp":1308350697000},"page":"323-335","source":"Crossref","is-referenced-by-count":4,"title":["Vectors in a box"],"prefix":"10.1007","volume":"135","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Matou\u0161ek","sequence":"additional","affiliation":[]},{"given":"Robin A.","family":"Moser","sequence":"additional","affiliation":[]},{"given":"D\u00f6m\u00f6t\u00f6r","family":"P\u00e1lv\u00f6lgyi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,18]]},"reference":[{"issue":"1\u20133","key":"474_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0166-218X(01)00337-7","volume":"123","author":"K. Aardal","year":"2002","unstructured":"Aardal K., Weismantel R., Wolsey L.A.: Non-standard approaches to integer programming. Discret. Appl. Math. 123(1\u20133), 5\u201374 (2002)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"474_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1006\/jcta.1997.2780","volume":"79","author":"N. Alon","year":"1997","unstructured":"Alon N., V\u0169 V.H.: Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs. J. Comb. Theory Ser. A 79(1), 133\u2013160 (1997)","journal-title":"J. Comb. Theory Ser. A"},{"key":"474_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-85221-6_1","volume-title":"Building bridges","author":"I. B\u00e1r\u00e1ny","year":"2008","unstructured":"B\u00e1r\u00e1ny I.: On the power of linear dependencies. In: Katona, Gy. O.H., Gr\u00f6tschel, M. (eds) Building bridges, pp. 31\u201346. Springer, Berlin (2008)"},{"key":"474_CR4","unstructured":"Dash, S., Fukasawa, R., G\u00fcnl\u00fck, O.: On a generalization of the master cyclic group polyhedron. Math. Program. (to appear)"},{"key":"474_CR5","unstructured":"Dash, S., Fukasawa, R., G\u00fcnl\u00fck, O.: The master equality polyhedron with multiple rows. Technical Report RC24746, IBM Research (2009)"},{"key":"474_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R.E. Gomory","year":"1969","unstructured":"Gomory R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2, 451\u2013558 (1969)","journal-title":"Linear Algebra Appl."},{"key":"474_CR7","first-page":"56","volume":"14","author":"V.S. Grinberg","year":"1980","unstructured":"Grinberg V.S., Sevastyanov S.V.: The value of the Steinitz constant (in Russian). Funk. Anal. Prilozh. 14, 56\u201357 (1980)","journal-title":"Funk. Anal. Prilozh."},{"key":"474_CR8","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/S0895480192235878","volume":"7","author":"J. H\u00e5stad","year":"1994","unstructured":"H\u00e5stad J.: On the size of weights for threshold gates. SIAM J. Discr. Math. 7, 484\u2013492 (1994)","journal-title":"SIAM J. Discr. Math."},{"issue":"4","key":"474_CR9","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"C.H. Papadimitriou","year":"1981","unstructured":"Papadimitriou C.H.: On the complexity of integer programming. J. ACM 28(4), 765\u2013768 (1981)","journal-title":"J. ACM"},{"key":"474_CR10","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver A.: Theory of linear and integer programming. Wiley, New York, NY, USA (1986)"},{"key":"474_CR11","unstructured":"Steinitz, E.: Bedingt konvergente Reihen und konvexe Systeme. J. Reine Ang. Mathematik, 143, 128\u2013175 (1913) Ibid., 144, 1\u201340 (1914) Ibid., 146, 1\u201352 (1916)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0474-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-011-0474-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0474-y.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0474-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T15:23:48Z","timestamp":1554650628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-011-0474-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,18]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["474"],"URL":"https:\/\/doi.org\/10.1007\/s10107-011-0474-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,18]]}}}