{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:29:43Z","timestamp":1759681783962,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,9,15]],"date-time":"2017-09-15T00:00:00Z","timestamp":1505433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10107-017-1196-6","type":"journal-article","created":{"date-parts":[[2017,9,15]],"date-time":"2017-09-15T04:14:45Z","timestamp":1505448885000},"page":"351-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Ellipsoidal mixed-integer representability"],"prefix":"10.1007","volume":"172","author":[{"given":"Alberto","family":"Del Pia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8747-182X","authenticated-orcid":false,"given":"Jeffrey","family":"Poskin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,15]]},"reference":[{"key":"1196_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, Berlin (2014)"},{"key":"1196_CR2","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"G Dantzig","year":"1957","unstructured":"Dantzig, G.: Discrete variable extremum problems. Oper. Res. 5, 266\u2013277 (1957)","journal-title":"Oper. Res."},{"key":"1196_CR3","doi-asserted-by":"crossref","unstructured":"Del Pia, A., Dey, S., Molinaro, M.: Mixed-integer quadratic programming is in NP. Math. Program. 162(1), 225\u2013240 (2017)","DOI":"10.1007\/s10107-016-1036-0"},{"key":"1196_CR4","doi-asserted-by":"crossref","unstructured":"Del\u00a0Pia, A., Poskin, J.: On the mixed binary representability of ellipsoidal regions. In: Proceedings of IPCO 2016, LNCS, vol. 9682, pp. 214\u2013225 (2016)","DOI":"10.1007\/978-3-319-33461-5_18"},{"key":"1196_CR5","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/BF01580429","volume":"8","author":"F Glover","year":"1975","unstructured":"Glover, F.: New results on equivalent integer programming formulations. Math. Program. 8, 84\u201390 (1975)","journal-title":"Math. Program."},{"key":"1196_CR6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0012-365X(76)90091-1","volume":"16","author":"T Ibaraki","year":"1976","unstructured":"Ibaraki, T.: Integer programming formulation of combinatorial optimization problems. Discret. Math. 16, 39\u201352 (1976)","journal-title":"Discret. Math."},{"key":"1196_CR7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00935492","volume":"30","author":"R Jeroslow","year":"1980","unstructured":"Jeroslow, R.: Representations of unbounded optimizations as integer programs. J. Optim. Theory Appl. 30, 339\u2013351 (1980)","journal-title":"J. Optim. Theory Appl."},{"key":"1196_CR8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(87)90026-6","volume":"17","author":"R Jeroslow","year":"1987","unstructured":"Jeroslow, R.: Representability in mixed integer programming, I: characterization results. Discret. Appl. Math. 17, 223\u2013243 (1987)","journal-title":"Discret. Appl. Math."},{"key":"1196_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0121015","volume":"22","author":"R Jeroslow","year":"1984","unstructured":"Jeroslow, R., Lowe, J.: Modelling with integer variables. Math. Program. Study 22, 167\u2013184 (1984)","journal-title":"Math. Program. Study"},{"issue":"3\/4","key":"1196_CR10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01262932","volume":"16","author":"R Meyer","year":"1975","unstructured":"Meyer, R.: Integer and mixed-integer programming models: General properties. J.Optim. Theory Appl. 16(3\/4), 191\u2013206 (1975)","journal-title":"J.Optim. Theory Appl."},{"key":"1196_CR11","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0012-365X(76)90145-X","volume":"16","author":"R Meyer","year":"1976","unstructured":"Meyer, R.: Mixed-integer minimization models for piecewise-linear functions of a single variable. Discret. Math. 16, 163\u2013171 (1976)","journal-title":"Discret. Math."},{"key":"1196_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/moor.5.1.135","volume":"5","author":"R Meyer","year":"1980","unstructured":"Meyer, R., Thakkar, M., Hallman, W.: Rational mixed integer and polyhedral union minimization models. Math. Oper. Res. 5, 135\u2013146 (1980)","journal-title":"Math. Oper. Res."},{"key":"1196_CR13","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R Rockafellar","year":"1970","unstructured":"Rockafellar, R.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"1196_CR14","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"issue":"I","key":"1196_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1137\/130915303","volume":"57","author":"J Vielma","year":"2015","unstructured":"Vielma, J.: Mixed integer linear programming formulation techniques. SIAM Rev. 57(I), 3\u201357 (2015)","journal-title":"SIAM Rev."},{"key":"1196_CR16","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-319-04280-0_22","volume-title":"Constraint Programming and Decision Making, Studies in Computational Intelligence","author":"K Villaverde","year":"2014","unstructured":"Villaverde, K., Kosheleva, O., Ceberio, M.: Why ellipsoid constraints, ellipsoid clusters, and Riemannian space-time: Dvoretzky\u2019s theorem revisited. In: Ceberio, M., Kreinovich, V. (eds.) Constraint Programming and Decision Making, Studies in Computational Intelligence, pp. 203\u2013207. Springer, Berlin (2014)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1196-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1196-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1196-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T22:26:51Z","timestamp":1693002411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1196-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,15]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1196"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1196-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2017,9,15]]}}}