{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:11:32Z","timestamp":1771035092681,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,5,5]],"date-time":"2017-05-05T00:00:00Z","timestamp":1493942400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,5,5]],"date-time":"2017-05-05T00:00:00Z","timestamp":1493942400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1634768"],"award-info":[{"award-number":["CMMI-1634768"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10107-017-1158-z","type":"journal-article","created":{"date-parts":[[2017,5,5]],"date-time":"2017-05-05T15:54:06Z","timestamp":1493999646000},"page":"387-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["On decomposability of Multilinear sets"],"prefix":"10.1007","volume":"170","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8428-3914","authenticated-orcid":false,"given":"Alberto","family":"Del Pia","sequence":"first","affiliation":[]},{"given":"Aida","family":"Khajavirad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,5]]},"reference":[{"key":"1158_CR1","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/10556780902883184","volume":"24","author":"X Bao","year":"2009","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs. Optim. Methods Softw. 24, 485\u2013504 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1158_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-014-0073-z","volume":"7","author":"X Bao","year":"2015","unstructured":"Bao, X., Khajavirad, A., Sahinidis, N.V., Tawarmalani, M.: Global optimization of nonconvex problems with multilinear intermediates. Math. Program. Comput. 7(1), 1\u201337 (2015)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"1158_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6377(83)90016-0","volume":"2","author":"F Barahona","year":"1983","unstructured":"Barahona, F.: The max-cut problem on graphs not contractible to $$K_5$$. Oper. Res. Lett. 2(3), 107\u2013111 (1983)","journal-title":"Oper. Res. Lett."},{"key":"1158_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F Barahona","year":"1986","unstructured":"Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Program. 36, 157\u2013173 (1986)","journal-title":"Math. Program."},{"issue":"3","key":"1158_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S0895480190182678","volume":"7","author":"F Barahona","year":"1994","unstructured":"Barahona, F., Mahjoub, A.R.: Compositions of graphs and polyhedra I\u2013IV. SIAM J. Discrete Math. 7(3), 359\u2013402 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"1158_CR6","volume-title":"Hypergraphs: Combinatorics of Finite Sets","author":"C Berge","year":"1984","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets. North-Holland Mathematical Library, Amsterdam (1984)"},{"key":"1158_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02115753","volume":"33","author":"E Boros","year":"1991","unstructured":"Boros, E., Hammer, P.L.: The max-cut problem and quadratic 0\u20131 optimization; polyhedral aspects, relaxations and bounds. Ann. Oper. Res. 33, 151\u2013180 (1991)","journal-title":"Ann. Oper. Res."},{"key":"1158_CR8","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1137\/050646500","volume":"18","author":"C Buchheim","year":"2007","unstructured":"Buchheim, C., Rinaldi, G.: Efficient reduction of polynomial zero\u2013one optimization to the quadratic case. SIAM J. Optim. 18, 1398\u20131413 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1158_CR9","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. J. Comb. Theory Ser. B 18(2), 138\u2013154 (1975)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1\u20132","key":"1158_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10107-015-0882-5","volume":"156","author":"M Conforti","year":"2016","unstructured":"Conforti, M., Pashkovich, K.: The projected faces property and polyhedral relations. Math. Program. Ser. A 156(1\u20132), 331\u2013342 (2016)","journal-title":"Math. Program. Ser. A"},{"key":"1158_CR11","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, vol. 6. MIT Press, Cambridge (2001)"},{"key":"1158_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01582138","volume":"61","author":"Y Crama","year":"1993","unstructured":"Crama, Y.: Concave extensions for non-linear 0\u20131 maximization problems. Math. Program. 61, 53\u201360 (1993)","journal-title":"Math. Program."},{"key":"1158_CR13","doi-asserted-by":"crossref","unstructured":"Crama, Y., Rodr\u00edguez-Heck, E.: A class of valid inequalities for multilinear 0\u20131 optimization problems. Discrete Optim. (2017)","DOI":"10.1016\/j.disopt.2017.02.001"},{"key":"1158_CR14","unstructured":"Del Pia, A., Khajavirad, A.: The multilinear polytope for $$\\gamma $$-acyclic hypergraphs. \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2016\/09\/5652.html\n                    \n                   (2016)"},{"key":"1158_CR15","unstructured":"Del\u00a0Pia, A., Khajavirad, A.: A polyhedral study of binary polynomial programs. Math. Oper. Res. 42(2), 389\u2013410 (2017)"},{"key":"1158_CR16","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Efficient algorithms for graph manipulation. Commun. ACM 16, 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"issue":"1\u20133","key":"1158_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0012-365X(93)90510-Z","volume":"113","author":"H-G Leimer","year":"1993","unstructured":"Leimer, H.-G.: Optimal decomposition by clique separators. Discrete Math. 113(1\u20133), 99\u2013123 (1993)","journal-title":"Discrete Math."},{"key":"1158_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-012-0606-z","volume":"136","author":"J Luedtke","year":"2012","unstructured":"Luedtke, J., Namazifar, M., Linderoth, J.T.: Some results on the strength of relaxations of multilinear functions. Math. Program. 136, 325\u2013351 (2012)","journal-title":"Math. Program."},{"key":"1158_CR19","unstructured":"Margot, F.: Composition de polytopes combinatoires: une approche par projection. Ph.D. Thesis, \u00c9cole polytechnique f\u00e9d\u00e9rale de Lausanne (1994)"},{"key":"1158_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I-convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"1158_CR21","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: algorithms for continuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2\u20133), 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1158_CR22","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/10556788.2014.916287","volume":"30","author":"R Misener","year":"2015","unstructured":"Misener, R., Smadbeck, J.B., Floudas, C.A.: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2. Optim. Methods Softw. 30(1), 215\u2013249 (2015)","journal-title":"Optim. Methods Softw."},{"key":"1158_CR23","unstructured":"Namazifar, M.: Strong relaxations and computations for multilinear programming. Ph.D. Thesis, University of Wisconsin-Madison (2011)"},{"key":"1158_CR24","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M.: The boolean quadric polytope: some characteristics, facets and relatives. Mathe. Program. 45, 139\u2013172 (1989)","journal-title":"Mathe. Program."},{"key":"1158_CR25","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"AD Rikun","year":"1997","unstructured":"Rikun, A.D.: A convex envelope formula for multilinear functions. J. Glob. Optim. 10, 425\u2013437 (1997)","journal-title":"J. Glob. Optim."},{"key":"1158_CR26","unstructured":"Sahinidis, N.V.: BARON 14.3.1: global optimization of mixed-integer nonlinear programs. User\u2019s Manual (2014)"},{"key":"1158_CR27","first-page":"245","volume":"22","author":"HD Sherali","year":"1997","unstructured":"Sherali, H.D.: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. Acta Math. Vietnam. 22, 245\u2013270 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"1158_CR28","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero\u2013one programming problems. SIAM J. Discrete Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1158_CR29","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"RE Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discrete Math. 55(2), 221\u2013232 (1985)","journal-title":"Discrete Math."},{"key":"1158_CR30","unstructured":"Tawarmalani, M.: Inclusion certificates and simultaneous convexification of functions. Working Paper. \n                    http:\/\/www.optimization-online.org\/DB_FILE\/2010\/09\/2722.pdf\n                    \n                   (2010)"},{"key":"1158_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer, Dordrecht (2002)"},{"key":"1158_CR32","unstructured":"Vigerske, S., Gleixner, A.: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Technical Report 16\u201324, ZIB, Berlin (2016)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1158-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1158-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1158-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:29:34Z","timestamp":1589646574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1158-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,5]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["1158"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1158-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,5]]},"assertion":[{"value":"28 May 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}