{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T22:08:38Z","timestamp":1768082918971,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T00:00:00Z","timestamp":1565222400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T00:00:00Z","timestamp":1565222400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s12532-019-00166-2","type":"journal-article","created":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T05:11:07Z","timestamp":1565241067000},"page":"69-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Partial hyperplane activation for generalized intersection cuts"],"prefix":"10.1007","volume":"12","author":[{"given":"Aleksandr M.","family":"Kazachkov","sequence":"first","affiliation":[]},{"given":"Selvaprabu","family":"Nadarajah","sequence":"additional","affiliation":[]},{"given":"Egon","family":"Balas","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Margot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,8]]},"reference":[{"key":"166_CR1","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-38189-8_18","volume-title":"Facets of Combinatorial Optimization","author":"Tobias Achterberg","year":"2013","unstructured":"Achterberg, T., Wunderling, R.: Mixed integer programming: analyzing 12 years of progress. In: Facets of Combinatorial Optimization, pp. 449\u2013481. Springer, Heidelberg (2013)"},{"issue":"4","key":"166_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006)","journal-title":"Oper. Res. Lett."},{"key":"166_CR3","unstructured":"Achterberg, T., Berthold, T., Koch, T., Wolter, K.: Constraint integer programming: a new approach to integrate CP and MIP. In: Perron, L., Trick, M.A. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 5th International Conference, CPAIOR 2008 Paris, France, May 20\u201323, 2008 Proceedings, pp. 6\u201320. Springer, Berlin (2008)"},{"key":"166_CR4","doi-asserted-by":"crossref","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L. A.: Inequalities from two rows of a simplex tableau. In: Integer Programming and Combinatorial Optimization, volume 4513 of Lecture Notes in Computer Scienc, pp. 1\u201315. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-72792-7_1"},{"issue":"1","key":"166_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts\u2013a new type of cutting planes for integer programming. Oper. Res. 19(1), 19\u201339 (1971)","journal-title":"Oper. Res."},{"key":"166_CR6","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."},{"issue":"1\u20132, Ser. A","key":"166_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10107-011-0483-x","volume":"137","author":"E Balas","year":"2013","unstructured":"Balas, E., Margot, F.: Generalized intersection cuts and a new cut generating paradigm. Math. Program. 137(1\u20132, Ser. A), 19\u201335 (2013)","journal-title":"Math. Program."},{"issue":"2, Ser. A","key":"166_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107-006-0049-5","volume":"113","author":"E Balas","year":"2008","unstructured":"Balas, E., Saxena, A.: Optimizing over the split closure. Math. Progam. 113(2, Ser. A), 219\u2013240 (2008)","journal-title":"Math. Progam."},{"issue":"3, Ser. A","key":"166_CR9","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$$-$$1$$ programs. Math. Program. 58(3, Ser. A), 295\u2013324 (1993)","journal-title":"Math. Program."},{"issue":"4","key":"166_CR10","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1287\/ijoc.1100.0437","volume":"23","author":"A Basu","year":"2011","unstructured":"Basu, A., Bonami, P., Cornu\u00e9jols, G., Margot, F.: Experiments with two-row cuts from degenerate tableaux. INFORMS J. Comput. 23(4), 578\u2013590 (2011)","journal-title":"INFORMS J. Comput."},{"key":"166_CR11","first-page":"16","volume":"25","author":"RE Bixby","year":"1992","unstructured":"Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: a test set of mixed integer programming problems. SIAM News 25, 16 (1992)","journal-title":"SIAM News"},{"key":"166_CR12","first-page":"12","volume":"58","author":"RE Bixby","year":"1998","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12\u201315 (1998)","journal-title":"Optima"},{"issue":"2","key":"166_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12532-012-0037-0","volume":"4","author":"P Bonami","year":"2012","unstructured":"Bonami, P.: On optimizing over lift-and-project closures. Math. Program. Comput. 4(2), 151\u2013179 (2012)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"166_CR14","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.orl.2008.01.004","volume":"36","author":"C Buchheim","year":"2008","unstructured":"Buchheim, C., Liers, F., Oswald, M.: Local cuts revisited. Oper. Res. Lett. 36(4), 430\u2013433 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"166_CR15","first-page":"105","volume":"16","author":"M Conforti","year":"2011","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Corner polyhedron and intersection cuts. Surv. Oper. Res. Manag. Sci. 16(2), 105\u2013120 (2011)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"1\u20132, Ser. A","key":"166_CR16","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10107-012-0542-y","volume":"141","author":"S Dash","year":"2013","unstructured":"Dash, S., G\u00fcnl\u00fck, O.: On $$t$$-branch split cuts for mixed-integer programs. Math. Program. 141(1\u20132, Ser. A), 591\u2013599 (2013)","journal-title":"Math. Program."},{"issue":"1, Ser. A","key":"166_CR17","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. Math. Program. 121(1, Ser. A), 33\u201360 (2010)","journal-title":"Math. Program."},{"issue":"4","key":"166_CR18","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1287\/ijoc.2014.0598","volume":"26","author":"S Dash","year":"2014","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Vielma, J.P.: Computational experiments with cross and crooked cross cuts. INFORMS J. Comput. 26(4), 780\u2013797 (2014)","journal-title":"INFORMS J. Comput."},{"key":"166_CR19","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.disopt.2014.12.003","volume":"16","author":"S Dash","year":"2015","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Molinaro, M.: On the relative strength of different generalizations of split cuts. Discret. Optim. 16, 36\u201350 (2015)","journal-title":"Discret. Optim."},{"key":"166_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-016-0982-x","volume":"160","author":"S Dash","year":"2016","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Diego, A., Mor\u00e1n, R.: On the polyhedrality of cross and quadrilateral closures. Math. Program. 160, 245\u2013270 (2016)","journal-title":"Math. Program."},{"issue":"1\u20132, Ser. A","key":"166_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-013-0645-0","volume":"145","author":"SS Dey","year":"2014","unstructured":"Dey, S.S., Pokutta, S.: Design and verify: a new scheme for generating cutting-planes. Math. Program. 145(1\u20132, Ser. A), 199\u2013222 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"166_CR22","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1287\/ijoc.2013.0559","volume":"26","author":"SS Dey","year":"2014","unstructured":"Dey, S.S., Lodi, A., Tramontani, A., Wolsey, L.A.: On the practical strength of two-row tableau cuts. INFORMS J. Comput. 26(2), 222\u2013237 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"166_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.orl.2009.10.016","volume":"38","author":"DG Espinoza","year":"2010","unstructured":"Espinoza, D.G.: Computing with multi-row Gomory cuts. Oper. Res. Lett. 38(2), 115\u2013120 (2010)","journal-title":"Oper. Res. Lett."},{"key":"166_CR24","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BFb0120689","volume":"2","author":"DR Fulkerson","year":"1974","unstructured":"Fulkerson, D.R., Nemhauser, G.L., Trotter, L.E.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. Math. Program. Stud. 2, 72\u201381 (1974)","journal-title":"Math. Program. Stud."},{"issue":"4","key":"166_CR25","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"RE Gomory","year":"1969","unstructured":"Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2(4), 451\u2013558 (1969)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"166_CR26","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01584976","volume":"3","author":"RE Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra. Math. Program. 3(1), 23\u201385 (1972)","journal-title":"Math. Program."},{"issue":"1","key":"166_CR27","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01585008","volume":"3","author":"RE Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra. II. Math. Program. 3(1), 359\u2013389 (1972)","journal-title":"Math. Program."},{"key":"166_CR28","unstructured":"Kazachkov, A.M., Nadarajah, S., Balas, E., Margot, F.: Code for \u201cPartial hyperplane activation for generalized intersection cuts\u201d (2019). \nhttps:\/\/doi.org\/10.5281\/zenodo.3266091"},{"issue":"2","key":"166_CR29","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010: mixed integer programming library version 5. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"166_CR30","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1147\/rd.471.0057","volume":"47","author":"R Lougee-Heimer","year":"2003","unstructured":"Lougee-Heimer, R.: The common optimization interface for operations research: promoting open-source software in the operations research community. IBM J. Res. Dev. 47, 57\u201366 (2003)","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"166_CR31","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s12532-014-0076-9","volume":"7","author":"Q Louveaux","year":"2015","unstructured":"Louveaux, Q., Poirrier, L., Salvagnin, D.: The strength of multi-row models. Math. Program. Comput. 7(2), 113\u2013148 (2015)","journal-title":"Math. Program. Comput."},{"key":"166_CR32","unstructured":"Mangasarian, O.L.: Nonlinear programming, volume 10 of Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1994)"},{"key":"166_CR33","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45535-3_27","volume-title":"Integer Programming and Combinatorial Optimization","author":"Michael Perregaard","year":"2001","unstructured":"Perregaard, M., Balas, E.: Generating cuts from multiple-term disjunctions. In: Integer Programming and Combinatorial Optimization, Volume 2081 of Lecture Notes in Computer Science, pp. 348\u2013360. Springer, Berlin (2001)"},{"issue":"1, Ser. A","key":"166_CR34","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10107-009-0335-0","volume":"130","author":"A Zanette","year":"2011","unstructured":"Zanette, A., Fischetti, M., Balas, E.: Lexicography and degeneracy: can a pure cutting plane algorithm work? Math. Program. 130(1, Ser. A), 153\u2013176 (2011)","journal-title":"Math. Program."},{"key":"166_CR35","volume-title":"Lectures on Polytopes, Volume 152 of Graduate Texts in Mathematics","author":"GM Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes, Volume 152 of Graduate Texts in Mathematics. Springer, New York (1995)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00166-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-019-00166-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00166-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T23:28:43Z","timestamp":1596756523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-019-00166-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,8]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["166"],"URL":"https:\/\/doi.org\/10.1007\/s12532-019-00166-2","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,8]]},"assertion":[{"value":"6 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}