{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T21:30:04Z","timestamp":1768080604176,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T00:00:00Z","timestamp":1526428800000},"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,7]]},"DOI":"10.1007\/s10107-018-1294-0","type":"journal-article","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T05:27:11Z","timestamp":1526448431000},"page":"207-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Binary extended formulations of polyhedral mixed-integer sets"],"prefix":"10.1007","volume":"170","author":[{"given":"Sanjeeb","family":"Dash","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9272-377X","authenticated-orcid":false,"given":"Oktay","family":"G\u00fcnl\u00fck","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Hildebrand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,16]]},"reference":[{"key":"1294_CR1","first-page":"275","volume":"45","author":"A Angulo","year":"2017","unstructured":"Angulo, A., Van Vyve, M.: Fixed-charge transportation problems on trees. OR Lett. 45, 275\u2013281 (2017)","journal-title":"OR Lett."},{"key":"1294_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk, A.: On the facets of the mixed-integer knapsack polyhedron. Math. Program. B 98, 145\u2013175 (2003)","journal-title":"Math. Program. B"},{"key":"1294_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discrete Math."},{"key":"1294_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58, 295\u2013323 (1993)","journal-title":"Math. Program."},{"key":"1294_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10107-016-1005-7","volume":"161","author":"M Bodur","year":"2017","unstructured":"Bodur, M., Dash, S., G\u00fcnl\u00fck, O.: Cutting planes derived from extended LP formulations. Math. Program. 161, 159\u2013192 (2017)","journal-title":"Math. Program."},{"key":"1294_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/ijoc.2016.0717","volume":"29","author":"M Bodur","year":"2016","unstructured":"Bodur, M., Dash, S., G\u00fcnl\u00fck, O., Luedtke, J.: Strengthened benders cuts for stochastic integer programs with continuous recourse. INFORMS J. Comput. 29, 77\u201399 (2016)","journal-title":"INFORMS J. Comput."},{"key":"1294_CR7","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10107-015-0924-z","volume":"154","author":"P Bonami","year":"2015","unstructured":"Bonami, P., Margot, F.: Cut generation through binarization. Math. Program. B 154, 197\u2013223 (2015)","journal-title":"Math. Program. B"},{"key":"1294_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornuejols, G., Zambelli, G.: Integer Programming. Springer, New York (2014)"},{"key":"1294_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"WJ Cook","year":"1990","unstructured":"Cook, W.J., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 47, 155\u2013174 (1990)","journal-title":"Math. Program."},{"key":"1294_CR10","unstructured":"IBM ILOG-CPLEX. Cplex 12.7 User\u2019s Manual (2017)"},{"issue":"1","key":"1294_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-008-0225-x","volume":"121","author":"S Dash","year":"2010","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Lodi, A.: MIR closures of polyhedral sets. Mathem. Program. 121(1), 33\u201360 (2010)","journal-title":"Mathem. Program."},{"key":"1294_CR12","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1287\/moor.1110.0496","volume":"26","author":"SS Dey","year":"2011","unstructured":"Dey, S.S., Louveaux, Q.: Split rank of triangle and quadrilateral inequalities. Mathem. Oper. Res. 26, 432\u2013461 (2011)","journal-title":"Mathem. Oper. Res."},{"key":"1294_CR13","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10107-011-0476-9","volume":"135","author":"A Pia Del","year":"2012","unstructured":"Del Pia, A., Weismantel, R.: On convergence in mixed integer programming. Math. Program. 135, 397\u2013412 (2012)","journal-title":"Math. Program."},{"key":"1294_CR14","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"RE Gomory","year":"1963","unstructured":"Gomory, R.E.: An Algorithm for Integer Solutions to Linear Programs. In: Graves, R.L., Wolfe, P. (eds.) Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"issue":"4","key":"1294_CR15","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover, F.: Improved linear integer programming formulations of nonlinear integer problems. Manag. Sci. 22(4), 455\u2013460 (1975)","journal-title":"Manag. Sci."},{"issue":"2","key":"1294_CR16","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/110836183","volume":"23","author":"A Gupte","year":"2013","unstructured":"Gupte, A., Ahmed, S., Cheon, M., Dey, S.: Solving mixed integer bilinear problems using MILP formulations. SIAM J. Optim. 23(2), 721\u2013744 (2013)","journal-title":"SIAM J. Optim."},{"key":"1294_CR17","doi-asserted-by":"crossref","unstructured":"Hildebrand, R., Weismantel, R., Zenklusen, R.: Extension complexity lower bounds for mixed-integer extended formulations. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2342\u20132350 (2017)","DOI":"10.1137\/1.9781611974782.154"},{"key":"1294_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0167-6377(92)90041-Z","volume":"11","author":"M Laurent","year":"1992","unstructured":"Laurent, M., Sassano, A.: A characterizatoin of knapsacks with the max-flow min-cut property. Oper. Res. Lett. 11, 105\u2013110 (1992)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1294_CR19","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1294_CR20","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/PL00011407","volume":"89","author":"JH Owen","year":"2001","unstructured":"Owen, J.H., Mehrotra, S.: A disjunctive cutting plane procedure for general mixed-integer linear programs. Math. Program. 89(3), 437\u2013448 (2001)","journal-title":"Math. Program."},{"key":"1294_CR21","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1287\/opre.50.5.810.370","volume":"50","author":"JH Owen","year":"2002","unstructured":"Owen, J.H., Mehrotra, S.: On the value of binary expansions for general mixed-integer linear programs. Oper. Res. 50, 810\u2013819 (2002)","journal-title":"Oper. Res."},{"key":"1294_CR22","first-page":"37","volume":"2","author":"JS Roy","year":"2007","unstructured":"Roy, J.S.: \u201cBinarize and Project\u201d to generate cuts for general mixed-integer programs. Algorithmic Oper. Res. 2, 37\u201351 (2007)","journal-title":"Algorithmic Oper. Res."},{"key":"1294_CR23","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 (1986)"},{"key":"1294_CR24","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-one programming problems. SIAM J. Discrete Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"1294_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"1999","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers, Norwell (1999)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1294-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1294-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1294-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T21:31:46Z","timestamp":1557955906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1294-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,16]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1294"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1294-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,16]]},"assertion":[{"value":"24 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}