{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T06:44:25Z","timestamp":1773384265370,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T00:00:00Z","timestamp":1522368000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T00:00:00Z","timestamp":1522368000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["1351619"],"award-info":[{"award-number":["1351619"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10107-018-1258-4","type":"journal-article","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T02:27:43Z","timestamp":1522376863000},"page":"21-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Small and strong formulations for unions of convex sets from the Cayley embedding"],"prefix":"10.1007","volume":"177","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4335-7248","authenticated-orcid":false,"given":"Juan Pablo","family":"Vielma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,30]]},"reference":[{"key":"1258_CR1","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1307\/mmj\/1029005073","volume":"41","author":"C Andradas","year":"1994","unstructured":"Andradas, C., Ruiz, J.M.: Ubiquity of \u0142ojasiewicz\u2019s example of a nonbasic semialgebraic set. Mich. Math. J. 41, 465\u2013472 (1994)","journal-title":"Mich. Math. J."},{"key":"1258_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0167-6377(88)90058-2","volume":"7","author":"E Balas","year":"1988","unstructured":"Balas, E.: On the convex-hull of the union of certain polyhedra. Oper. Res. Lett. 7, 279\u2013283 (1988)","journal-title":"Oper. Res. Lett."},{"key":"1258_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. Society for Industrial Mathematics (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"1258_CR4","unstructured":"Bestuzheva, K., Hijazi, H., Coffrin, C.: Convex Relaxations for Quadratic On\/Off Constraints and Applications to Optimal Transmission Switching (2016). Optimization Online. \n                              http:\/\/www.optimization-online.org\/DB_HTML\/2016\/07\/5565.html"},{"key":"1258_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01588775","volume":"49","author":"C Blair","year":"1990","unstructured":"Blair, C.: Representation for multiple right-hand sides. Math. Program. 49, 1\u20135 (1990)","journal-title":"Math. Program."},{"key":"1258_CR6","doi-asserted-by":"crossref","unstructured":"Blekherman, G., Parrilo, P., Thomas, R.: Semidefinite Optimization and Convex Algebraic Geometry. MPS-SIAM Series on Optimization. SIAM (2013)","DOI":"10.1137\/1.9781611972290"},{"key":"1258_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-015-0891-4","volume":"151","author":"P Bonami","year":"2015","unstructured":"Bonami, P., Lodi, A., Tramontani, A., Wiese, S.: On mathematical programming with indicator constraints. Math. Program. 151, 191\u2013223 (2015)","journal-title":"Math. Program."},{"key":"1258_CR8","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S Ceria","year":"1999","unstructured":"Ceria, S., Soares, J.: Convex programming for disjunctive convex optimization. Math. Program. 86, 595\u2013614 (1999)","journal-title":"Math. Program."},{"key":"1258_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10107-010-0360-z","volume":"124","author":"O G\u00fcnl\u00fck","year":"2010","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124, 183\u2013205 (2010)","journal-title":"Math. Program."},{"key":"1258_CR10","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/07070526X","volume":"20","author":"JW Helton","year":"2009","unstructured":"Helton, J.W., Nie, J.: Sufficient and necessary conditions for semidefinite representability of convex hulls and sets. SIAM J. Optim. 20, 759\u2013791 (2009)","journal-title":"SIAM J. Optim."},{"key":"1258_CR11","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10589-011-9424-0","volume":"52","author":"H Hijazi","year":"2012","unstructured":"Hijazi, H., Bonami, P., Cornu\u00e9jols, G., Ouorou, A.: Mixed-integer nonlinear programs featuring \u201con\/off\u201d constraints. Comput. Optim. Appl. 52, 537\u2013558 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"1258_CR12","unstructured":"Hijazi, H., Bonami, P., Ouorou, A.: A Note on Linear On\/Off Constraints (2014). Optimization Online. \n                              http:\/\/www.optimization-online.org\/DB_HTML\/2014\/04\/4309.html"},{"key":"1258_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s12532-016-0112-z","volume":"9","author":"H Hijazi","year":"2017","unstructured":"Hijazi, H., Coffrin, C., Van Hentenryck, P.: Convex quadratic relaxations for mixed-integer nonlinear programs in power systems. Math. Program. Comput. 9, 321\u2013367 (2017)","journal-title":"Math. Program. Comput."},{"key":"1258_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56468-0","volume-title":"Fundamentals of Convex Analysis","author":"JB Hiriart-Urruty","year":"2001","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer, Heidelberg (2001)"},{"key":"1258_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s100970050003","volume":"2","author":"B Huber","year":"2000","unstructured":"Huber, B., Rambau, J., Santos, F.: The cayley trick, lifting subdivisions and the bohne-dress theorem on zonotopal tilings. J. Eur. Math. Soc. 2, 179\u2013198 (2000)","journal-title":"J. Eur. Math. Soc."},{"key":"1258_CR16","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/0377-2217(88)90013-6","volume":"36","author":"RG Jeroslow","year":"1988","unstructured":"Jeroslow, R.G.: A simplification for some disjunctive formulations. Eur. J. Oper. Res. 36, 116\u2013121 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"1258_CR17","unstructured":"Karavelas, M.I., Konaxis, C., Tzanaki, E.: The maximum number of faces of the Minkowski sum of three convex polytopes. In: da\u00a0Fonseca, G.D., Lewiner, T., Pe\u00f1aranda, L.M., Chan, T.M., Klein, R. (eds.) Symposuim on Computational Geometry 2013, SoCG\u201913, Rio de Janeiro, Brazil, June 17\u201320, 2013, pp. 187\u2013196. ACM (2013)"},{"key":"1258_CR18","doi-asserted-by":"crossref","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Extended formulations in mixed-integer convex programming. In: Louveaux, Q., Skutella, M. (eds.) Integer Programming and Combinatorial Optimization\u201418th International Conference, IPCO 2016, Li\u00e8ge, Belgium, June 1\u20133, 2016, Proceedings, LNCS, vol. 9682, pp. 102\u2013113. Springer, Berlin (2016)","DOI":"10.1007\/978-3-319-33461-5_9"},{"key":"1258_CR19","doi-asserted-by":"publisher","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Polyhedral approximation in mixed-integer convex optimization. Math. Program. (to appear) (2017). \n                              https:\/\/doi.org\/10.1007\/s10107-017-1191-y","DOI":"10.1007\/s10107-017-1191-y"},{"key":"1258_CR20","volume-title":"Convex Analysis. Princeton Landmarks in Mathematics and Physics","author":"R Rockafellar","year":"2015","unstructured":"Rockafellar, R.: Convex Analysis. Princeton Landmarks in Mathematics and Physics. Princeton University Press, Princeton (2015)"},{"key":"1258_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86, 515\u2013532 (1999)","journal-title":"Math. Program."},{"key":"1258_CR22","unstructured":"Tawarmalani, M.: Inclusion Certificates and Simultaneous Convexification of Functions (2010). Optimization Online. \n                              http:\/\/www.optimization-online.org\/DB_HTML\/2010\/09\/2722.html"},{"key":"1258_CR23","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10107-010-0374-6","volume":"124","author":"M Tawarmalani","year":"2010","unstructured":"Tawarmalani, M., Richard, J., Chung, K.: Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. Math. Program. 124, 481\u2013512 (2010)","journal-title":"Math. Program."},{"key":"1258_CR24","doi-asserted-by":"publisher","unstructured":"Vielma, J.P.: Embedding formulations and complexity for unions of polyhedra. Manag. Sci. (to appear) (2017). \n                              https:\/\/doi.org\/10.1287\/mnsc.2017.2856","DOI":"10.1287\/mnsc.2017.2856"},{"key":"1258_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/130915303","volume":"57","author":"JP Vielma","year":"2015","unstructured":"Vielma, J.P.: Mixed integer linear programming formulation techniques. SIAM Rev. 57, 3\u201357 (2015)","journal-title":"SIAM Rev."},{"key":"1258_CR26","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","volume":"128","author":"JP Vielma","year":"2011","unstructured":"Vielma, J.P., Nemhauser, G.L.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128, 49\u201372 (2011)","journal-title":"Math. Program."},{"key":"1258_CR27","unstructured":"Weibel, C.: Minkowski Sums of Polytopes: Combinatorics and Computation. Ph.D. thesis, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (2007)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1258-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1258-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1258-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:25:45Z","timestamp":1589646345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1258-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,30]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1258"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1258-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,30]]},"assertion":[{"value":"12 April 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}