{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T15:53:37Z","timestamp":1666367617748},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,1,17]],"date-time":"2018-01-17T00:00:00Z","timestamp":1516147200000},"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. Prog. Comp."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s12532-018-0132-y","type":"journal-article","created":{"date-parts":[[2018,1,17]],"date-time":"2018-01-17T08:38:42Z","timestamp":1516178322000},"page":"423-455","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Intersection cuts for single row corner relaxations"],"prefix":"10.1007","volume":"10","author":[{"given":"Ricardo","family":"Fukasawa","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Poirrier","sequence":"additional","affiliation":[]},{"given":"\u00c1linson S.","family":"Xavier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,17]]},"reference":[{"issue":"2","key":"132_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.disopt.2005.10.008","volume":"3","author":"A Agra","year":"2006","unstructured":"Agra, A., Constantino, M.F.: Description of 2-integer continuous knapsack polyhedra. Discrete Optim. 3(2), 95\u2013110 (2006). https:\/\/doi.org\/10.1016\/j.disopt.2005.10.008","journal-title":"Discrete Optim."},{"issue":"1","key":"132_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-006-0705-9","volume":"109","author":"A Agra","year":"2007","unstructured":"Agra, A., Constantino, M.F.: Lifting two-integer knapsack inequalities. Math. Program. 109(1), 115\u2013154 (2007). https:\/\/doi.org\/10.1007\/s10107-006-0705-9","journal-title":"Math. Program."},{"key":"132_CR3","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.: Cutting planes from two rows of a simplex tableau (extended version). Working Paper (2006). http:\/\/orbi.ulg.ac.be\/handle\/2268\/82794"},{"key":"132_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72792-7_1","volume-title":"Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science","author":"K Andersen","year":"2007","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.: Inequalities from two rows of a simplex tableau. In: Fischetti, M., Williamson, D. (eds.) Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 4513, pp. 1\u201315. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_1"},{"key":"132_CR5","unstructured":"Atamt\u00fcrk, A., Rajan, D.: Valid inequalities for mixed-integer knapsack from two-integer variable restrictions. Research Report BCOL.04.02, IEOR, University of California, Berkeley (December 2004)"},{"issue":"19","key":"132_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"1","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts\u2014a new type of cutting planes for integer programming. Oper. Res. 1(19), 19\u201339 (1971)","journal-title":"Oper. Res."},{"issue":"4","key":"132_CR7","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","volume":"4","author":"E Balas","year":"1980","unstructured":"Balas, E., Jeroslow, R.G.: Combinational optimization strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4(4), 224\u2013234 (1980). https:\/\/doi.org\/10.1016\/0377-2217(80)90106-X","journal-title":"Eur. J. Oper. Res."},{"key":"132_CR8","doi-asserted-by":"crossref","unstructured":"Balas, E., Margot, F.: Generalized intersection cuts and a new cut generating paradigm. Math. Program. (2011). https:\/\/doi.org\/10.1007\/s10107-011-0483-x","DOI":"10.1007\/s10107-011-0483-x"},{"key":"132_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G., Natraj, N.R.: Gomory cuts revisited. Oper. Res. Lett. 19, 1\u20139 (1996)","journal-title":"Oper. Res. Lett."},{"key":"132_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-13036-6_7","volume-title":"Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science","author":"A Basu","year":"2010","unstructured":"Basu, A., Campelo, M., Conforti, M., Cornu\u00e9jols, G.: On lifting integer variables in minimal inequalities. In: Eisenbrand, F., Shepherd, F.B. (eds.) Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 6080, pp. 85\u201395. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-13036-6_7"},{"issue":"1","key":"132_CR11","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/090756375","volume":"24","author":"A Basu","year":"2010","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Minimal inequalities for an infinite relaxation of integer programs. SIAM J. Discrete Math. 24(1), 158\u2013168 (2010). https:\/\/doi.org\/10.1137\/090756375","journal-title":"SIAM J. Discrete Math."},{"key":"132_CR12","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, 578\u2013590 (2011)","journal-title":"INFORMS J. Comput."},{"key":"132_CR13","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M.: Algorithmic and complexity results for cutting planes derived from maximal lattice-free convex sets (2011). https:\/\/arxiv.org\/abs\/1107.5068v1"},{"issue":"3","key":"132_CR14","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.1080.0370","volume":"34","author":"V Borozan","year":"2009","unstructured":"Borozan, V., Cornu\u00e9jols, G.: Minimal valid inequalities for integer constraints. Math. Oper. Res. 34(3), 538\u2013546 (2009). https:\/\/doi.org\/10.1287\/moor.1080.0370","journal-title":"Math. Oper. Res."},{"key":"132_CR15","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1287\/opre.1110.0916","volume":"59","author":"M Conforti","year":"2011","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: A geometric perspective on lifting. Oper. Res. 59, 569\u2013577 (2011). https:\/\/doi.org\/10.1287\/opre.1110.0916","journal-title":"Oper. Res."},{"key":"132_CR16","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer (2014). ISBN 3319110071, 9783319110073","DOI":"10.1007\/978-3-319-11008-0"},{"key":"132_CR17","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. Progr. 47, 155\u2013174 (1990)","journal-title":"Math. Progr."},{"issue":"1","key":"132_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01191202","volume":"12","author":"WJ Cook","year":"1992","unstructured":"Cook, W.J., Hartmann, M., Kannan, R., McDiarmid, C.: On integer points in polyhedra. Combinatorica 12(1), 27\u201337 (1992). https:\/\/doi.org\/10.1007\/BF01191202","journal-title":"Combinatorica"},{"issue":"2","key":"132_CR19","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10107-008-0221-1","volume":"120","author":"G Cornu\u00e9jols","year":"2009","unstructured":"Cornu\u00e9jols, G., Margot, F.: On the facets of mixed integer programs with two integer variables and two constraints. Math. Progr. 120(2), 429\u2013456 (2009). https:\/\/doi.org\/10.1007\/s10107-008-0221-1","journal-title":"Math. Progr."},{"issue":"2","key":"132_CR20","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0179-4","volume":"115","author":"S Dash","year":"2008","unstructured":"Dash, S., G\u00fcnl\u00fck, O.: On the strength of gomory mixed-integer cuts as group cuts. Math. Progr. 115(2), 387\u2013407 (2008). https:\/\/doi.org\/10.1007\/s10107-007-0179-4","journal-title":"Math. Progr."},{"issue":"2","key":"132_CR21","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1287\/ijoc.1090.0337","volume":"22","author":"S Dash","year":"2010","unstructured":"Dash, S., Goycoolea, M., G\u00fcnl\u00fck, O.: Two-step MIR inequalities for mixed integer programs. INFORMS J. Comput. 22(2), 236\u2013249 (2010). https:\/\/doi.org\/10.1287\/ijoc.1090.0337","journal-title":"INFORMS J. Comput."},{"key":"132_CR22","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Wolsey, L.A.: Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.), 13th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2008, Bertinoro, Italy, May 26\u201328, 2008, Proceedings of Lecture Notes in Computer Science, vol. 5035, Springer, pp. 463\u2013475 (2008)","DOI":"10.1007\/978-3-540-68891-4_32"},{"key":"132_CR23","unstructured":"Dey, S.S., Wolsey, L.A.: Constrained infinite group relaxations of MIPs. CORE Discussion Papers 2009033, Universit\u00e9 Catholique de Louvain, Center for Operations Research and Econometrics (CORE), (May 2009). URL http:\/\/ideas.repec.org\/p\/cor\/louvco\/2009033.html"},{"key":"132_CR24","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10107-010-0362-x","volume":"124","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Wolsey, L.A.: Two row mixed-integer cuts via lifting. Math. Progr. 124, 143\u2013174 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0362-x","journal-title":"Math. Progr."},{"issue":"4","key":"132_CR25","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.disopt.2010.06.001","volume":"7","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Wolsey, L.A.: Composite lifting of group inequalities and an application to two-row mixing inequalities. Discrete Optim. 7(4), 256\u2013268 (2010). https:\/\/doi.org\/10.1016\/j.disopt.2010.06.001","journal-title":"Discrete Optim."},{"key":"132_CR26","doi-asserted-by":"publisher","unstructured":"Fischetti M., Saturni, C.: Mixed-integer cuts from cyclic groups. In: J\u00fcnger, M., Kaibel, V. (eds.), 11th International IPCO Conference on Integer Programming and Combinatorial Optimization, Berlin, Germany, June 8\u201310, 2005. Proceedings, pp. 1\u201311, Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/11496915_1","DOI":"10.1007\/11496915_1"},{"issue":"2","key":"132_CR27","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.disopt.2010.09.002","volume":"8","author":"R Fukasawa","year":"2011","unstructured":"Fukasawa, R., G\u00fcnl\u00fck, O.: Strengthening lattice-free cuts using non-negativity. Discrete Optim. 8(2), 229\u2013245 (2011). https:\/\/doi.org\/10.1016\/j.disopt.2010.09.002","journal-title":"Discrete Optim."},{"issue":"1\u20132","key":"132_CR28","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10107-009-0284-7","volume":"128","author":"R Fukasawa","year":"2011","unstructured":"Fukasawa, R., Goycoolea, M.: On the exact separation of mixed integer knapsack cuts. Math. Progr. 128(1\u20132), 19\u201341 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0284-7","journal-title":"Math. Progr."},{"key":"132_CR29","unstructured":"Fukasawa, R., Poirrier, L., Xavier, \u00c1.S.: The (not so) trivial lifting in two dimensions (2016). http:\/\/www.optimization-online.org\/DB_HTML\/2016\/11\/5706.html"},{"key":"132_CR30","doi-asserted-by":"publisher","unstructured":"Fukasawa, R., Poirrier, L., Xavier, \u00c1.S.: Intersection cuts for single row corner relaxations: source code (January 2018). https:\/\/doi.org\/10.5281\/zenodo.1064310","DOI":"10.5281\/zenodo.1064310"},{"key":"132_CR31","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, The Rand Corporation (1960)"},{"issue":"4","key":"132_CR32","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). https:\/\/doi.org\/10.1016\/0024-3795(69)90017-2","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"132_CR33","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, part II. Math. Progr. 3(1), 359\u2013389 (1972). https:\/\/doi.org\/10.1007\/BF01585008","journal-title":"Math. Progr."},{"key":"132_CR34","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, part I. Math. Progr. 3, 23\u201385 (1972)","journal-title":"Math. Progr."},{"key":"132_CR35","unstructured":"Granlund, T., GMP Development Team: GNU MP: The GNU Multiple Precision Arithmetic Library, 6.1.0 edn (2015). http:\/\/gmplib.org\/"},{"issue":"6","key":"132_CR36","doi-asserted-by":"publisher","first-page":"2285","DOI":"10.1137\/S009753979528977X","volume":"28","author":"W Harvey","year":"1999","unstructured":"Harvey, W.: Computing two-dimensional integer hulls. SIAM J. Comput. 28(6), 2285\u20132299 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"132_CR37","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/321921.321936","volume":"23","author":"DS Hirschberg","year":"1976","unstructured":"Hirschberg, D.S., Wong, C.K.: A polynomial-time algorithm for the knapsack problem with two variables. J. ACM 23(1), 147\u2013154 (1976). https:\/\/doi.org\/10.1145\/321921.321936","journal-title":"J. ACM"},{"issue":"2","key":"132_CR38","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. Math. Progr. Comput. 3(2), 103\u2013163 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0025-9","journal-title":"Math. Progr. Comput."},{"issue":"1\u20132","key":"132_CR39","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10107-012-0597-9","volume":"143","author":"Q Louveaux","year":"2014","unstructured":"Louveaux, Q., Poirrier, L.: An algorithm for the separation of two-row cuts. Math. Progr. 143(1\u20132), 111\u2013146 (2014). https:\/\/doi.org\/10.1007\/s10107-012-0597-9","journal-title":"Math. Progr."},{"issue":"2","key":"132_CR40","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. Progr. Comput. 7(2), 113\u2013148 (2015). https:\/\/doi.org\/10.1007\/s12532-014-0076-9","journal-title":"Math. Progr. Comput."},{"key":"132_CR41","first-page":"177","volume":"6","author":"L Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz, L.: Geometry of numbers and integer programming. Proc. Math. Appl. Jpn. Ser. 6, 177\u2013201 (1989)","journal-title":"Proc. Math. Appl. Jpn. Ser."},{"key":"132_CR42","first-page":"2001","volume":"49","author":"H Marchand","year":"1998","unstructured":"Marchand, H., Wolsey, L.A.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49, 2001 (1998)","journal-title":"Oper. Res."},{"key":"132_CR43","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"GL Nemhauser","year":"1990","unstructured":"Nemhauser, G.L., Wolsey, L.A.: A recursive procedure to generate all cuts for 0\u20131 mixed integer programs. Math. Progr. 46, 379\u2013390 (1990). https:\/\/doi.org\/10.1007\/BF01585752","journal-title":"Math. Progr."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-018-0132-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0132-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0132-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T12:43:54Z","timestamp":1570625034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-018-0132-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,17]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["132"],"URL":"https:\/\/doi.org\/10.1007\/s12532-018-0132-y","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,17]]},"assertion":[{"value":"4 May 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}