{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:11Z","timestamp":1740108251670,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T00:00:00Z","timestamp":1595808000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T00:00:00Z","timestamp":1595808000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s00186-020-00723-9","type":"journal-article","created":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T14:04:09Z","timestamp":1595858649000},"page":"545-575","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the facet defining inequalities of the mixed-integer bilinear covering set"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8237-445X","authenticated-orcid":false,"given":"Hamidur","family":"Rahman","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4602-7431","authenticated-orcid":false,"given":"Ashutosh","family":"Mahajan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,27]]},"reference":[{"key":"723_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-36694-9_4","volume-title":"Integer programming and combinatorial optimization","author":"K Andersen","year":"2013","unstructured":"Andersen K, Jensen AN (2013) Intersection cuts for mixed integer conic quadratic sets. In: Goemans M, Correa J (eds) Integer programming and combinatorial optimization. Springer, Berlin, pp 37\u201348"},{"key":"723_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-008-0239-4","volume":"122","author":"A Atamt\u00fcrk","year":"2010","unstructured":"Atamt\u00fcrk A, Narayanan V (2010) Conic mixed-integer rounding cuts. Math Program A 122:1\u201320","journal-title":"Math Program A"},{"key":"723_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 (1979) Disjunctive programming. Ann Discrete Math 5:3\u201351","journal-title":"Ann Discrete Math"},{"issue":"1\u20133","key":"723_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"58","author":"E Balas","year":"1998","unstructured":"Balas E (1998) Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl Math 58(1\u20133):3\u201344","journal-title":"Discrete Appl Math"},{"key":"723_CR5","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 (1993) A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math Program 58:295\u2013324","journal-title":"Math Program"},{"key":"723_CR6","first-page":"117","volume-title":"Mixed integer nonlinear programming. The IMA volumes in mathematics and its applications","author":"P Belloti","year":"2012","unstructured":"Belloti P (2012) Disjunctive cuts for nonconvex MINLP. In: Lee J, Leyffer S (eds) Mixed integer nonlinear programming. The IMA volumes in mathematics and its applications, vol 154. Springer, Berlin, pp 117\u2013144"},{"key":"723_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-20807-2_5","volume-title":"Integer programming and combinatoral optimization","author":"P Bonami","year":"2011","unstructured":"Bonami P (2011) Lift-and-project cuts for mixed integer convex programs. In: G\u00fcnl\u00fck O, Woeginger JG (eds) Integer programming and combinatoral optimization. Springer, Berlin, pp 52\u201364"},{"key":"723_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A Caparara","year":"2003","unstructured":"Caparara A, Letchford AN (2003) On the separation of split cuts and related inequalities. Math Program 94:279\u2013294","journal-title":"Math Program"},{"key":"723_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-005-0578-3","volume":"104","author":"MT \u00c7ezik","year":"2005","unstructured":"\u00c7ezik MT, Iyengar G (2005) Cuts for mixed 0\u20131 conic programming. Math Program A 104:179\u2013202","journal-title":"Math Program A"},{"key":"723_CR10","doi-asserted-by":"crossref","unstructured":"Conforti M, Cornu\u00e9jols G, Zambelli G (2010) Polyhedral approaches to mixed integer linear programming. In: J\u00fcnger M, Liebling ThM, Naddef D, Nemhauser GL, Pulleyblank WR, Reinelt G, Rinaldi , Wolsey LA (eds) 50 Years of integer programming. Springer, Berlin, pp 1958\u20132008","DOI":"10.1007\/978-3-540-68279-0_11"},{"key":"723_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W Cook","year":"1990","unstructured":"Cook W, Kannan R, Schrijver A (1990) Chv\u00e1tal closures for mixed integer programming problems. Math Program 47:155\u2013174","journal-title":"Math Program"},{"key":"723_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-006-0086-0","volume":"112","author":"G Cornu\u00e9jols","year":"2008","unstructured":"Cornu\u00e9jols G (2008) Valid inequalities for mixed integer linear programs. Math Program B 112:3\u201344","journal-title":"Math Program B"},{"key":"723_CR13","unstructured":"Cutting stock test instances and results. http:\/\/www.math.tu-dresden.de\/~capad\/cpd-ti.html. Last Accessed 7 Dec 2019"},{"key":"723_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.orl.2011.02.002","volume":"39","author":"D Dadush","year":"2011","unstructured":"Dadush D, Dey SS, Vielma JP (2011) The split closure of a strictly convex body. Oper Res Lett 39:121\u2013126","journal-title":"Oper Res Lett"},{"key":"723_CR15","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10107-013-0654-z","volume":"145","author":"S Dash","year":"2014","unstructured":"Dash S, Dobbs NB, G\u00fcnl\u00fck O, Nowicki TJ, Swirszcz GM (2014) Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming. Math Program A 145:483\u2013508","journal-title":"Math Program A"},{"key":"723_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10107-009-0329-y","volume":"130","author":"S Dey","year":"2011","unstructured":"Dey S (2011) A note on the split rank of intersection cuts. Math Program A 130:107\u2013124","journal-title":"Math Program A"},{"issue":"3","key":"723_CR17","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1287\/moor.1110.0496","volume":"36","author":"S Dey","year":"2011","unstructured":"Dey S, Louveaux Q (2011) Split rank of triangle and quadrilateral inequalities. Math Oper Res 36(3):432\u2013461","journal-title":"Math Oper Res"},{"key":"723_CR18","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s11081-018-9402-9","volume":"20","author":"SS Dey","year":"2019","unstructured":"Dey SS, Santana A, Wang Y (2019) New SOCP relaxation and branching rule for bipartite bilinear programs. Optim Eng 20:307\u2013336","journal-title":"Optim Eng"},{"key":"723_CR19","unstructured":"Forrest J, Lougee-Heimerl R (2005) CBC (Coin-or Branch-and-Cut) Solver. https:\/\/projects.coin-or.org\/Cbc. Accessed 20 Dec 2019"},{"key":"723_CR20","unstructured":"Forrest J, Saltzman M, Hafer L, Hall J (2004) COIN-OR Linear Program Solver (CLP). https:\/\/projects.coin-or.org\/Clp. Accessed 20 Dec 2019"},{"key":"723_CR21","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Co., New York"},{"key":"723_CR22","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/0377-2217(95)00023-J","volume":"84","author":"T Gau","year":"1995","unstructured":"Gau T, Wascher G (1995) CUTGEN1: a problem generator for the standard one-dimensional cutting stock problem. Eur J Oper Res 84:572\u2013579","journal-title":"Eur J Oper Res"},{"key":"723_CR23","doi-asserted-by":"crossref","unstructured":"Gomory RE (1960) Solving linear programming problems in integers. In: Bellman MHR (ed) Combinatorial analysis. Proceedings of symposia in applied mathematics, vol 10, pp 269\u2013308","DOI":"10.1090\/psapm\/010\/0114670"},{"key":"723_CR24","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"RE Gomory","year":"1969","unstructured":"Gomory RE (1969) Some polyhedra related to combinatorial problems. Linear Algebra Appl 2:451\u2013558","journal-title":"Linear Algebra Appl"},{"key":"723_CR25","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/S0377-2217(97)00066-0","volume":"105","author":"I Harjunkoski","year":"1998","unstructured":"Harjunkoski I, Westerlund T, Porn R, Skrifvars H (1998) Different transformations for solving non-convex trim-loss problems by MINLP. Eur J Oper Res 105:594\u2013603","journal-title":"Eur J Oper Res"},{"issue":"1","key":"723_CR26","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1287\/opre.21.1.221","volume":"21","author":"RC Jeroslow","year":"1973","unstructured":"Jeroslow RC (1973) There cannot be any algorithm for integer programming with quadratic constraints. Oper Res 21(1):221\u2013224","journal-title":"Oper Res"},{"key":"723_CR27","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"GM Katta","year":"1987","unstructured":"Katta GM, Santosh NK (1987) Some NP-complete problems in quadratic and nonlinear programming. Math Program B 39:117\u2013129","journal-title":"Math Program B"},{"key":"723_CR28","unstructured":"K\u0131l\u0131n\u00e7 MR, Linderoth JT, Luedtke J (2010) Effective separation of disjunctive cuts for convex mixed integer nonlinear programs. Technical Report, University of Wisconsin, Madison"},{"key":"723_CR29","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-13036-6_20","volume-title":"Integer programming and combinatorial optimization","author":"AN Letchford","year":"2010","unstructured":"Letchford AN (2010) Integer quadratic quasi-polyhedra. In: Eisenbrand F, Shepherd FB (eds) Integer programming and combinatorial optimization. Springer, Berlin, pp 258\u2013270"},{"key":"723_CR30","unstructured":"Mitchell S, Kean A, Mason A, O\u2019Sullivan M, Phillips A (2011) PuLP. https:\/\/www.coin-or.org\/PuLP\/"},{"key":"723_CR31","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.orl.2014.10.006","volume":"43","author":"S Modaresi","year":"2015","unstructured":"Modaresi S, K\u0131l\u0131n\u00e7 MR, Vielma JP (2015) Split cuts and extended formulations for mixed integer conic quadratic programming. Oper Res Lett 43:10\u201315","journal-title":"Oper Res Lett"},{"key":"723_CR32","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10107-015-0866-5","volume":"155","author":"S Modaresi","year":"2016","unstructured":"Modaresi S, K\u0131l\u0131n\u00e7 MR, Vielma JP (2016) Intersection cuts for nonlinear integer programming: convexification techniques for structured sets. Math Program A 155:575\u2013611","journal-title":"Math Program A"},{"key":"723_CR33","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York"},{"key":"723_CR34","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"GL Nemhauser","year":"1990","unstructured":"Nemhauser GL, Wolsey LA (1990) A recursive procedure to generate all cuts for 0\u20131 mixed-integer programs. Math Program B 46:379\u2013390","journal-title":"Math Program B"},{"key":"723_CR35","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/PL00011407","volume":"89","author":"JH Owen","year":"2001","unstructured":"Owen JH, Mehrotra S (2001) A disjunctive cutting plane procedure for general mixed integer linear programs. Math Program A 89:437\u2013448","journal-title":"Math Program A"},{"key":"723_CR36","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10898-019-00783-0","volume":"74","author":"H Rahman","year":"2019","unstructured":"Rahman H, Mahajan A (2019) Facets of a mixed-integer bilinear covering set with bounds on variables. J Glob Optim 74:417\u2013442","journal-title":"J Glob Optim"},{"key":"723_CR37","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-68891-4_2","volume-title":"Integer programming and combinatorial optimization","author":"A Saxena","year":"2008","unstructured":"Saxena A, Bonami P, Lee J (2008) Disjunctive cuts for non-convex mixed integer quadratically constrained programs. In: Lodi A, Panconesi A, Rinaldi G (eds) Integer programming and combinatorial optimization. Springer, Berlin, pp 17\u201333"},{"key":"723_CR38","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubs","year":"1999","unstructured":"Stubs RA, Mehrotra S (1999) A branch-and-cut method for 0\u20131 mixed convex programming. Math Program A 86:515\u2013532","journal-title":"Math Program A"},{"key":"723_CR39","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 JP, Chung K (2010) Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. Math Program B 124:481\u2013512","journal-title":"Math Program B"},{"key":"723_CR40","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/S0377-2217(02)00239-4","volume":"146","author":"S Umetani","year":"2003","unstructured":"Umetani S, Yagiura M, Ibaraki T (2003) One dimensional cutting stock problem to minimize the number of different patterns. Eur J Oper Res 146:388\u2013402","journal-title":"Eur J Oper Res"},{"issue":"6","key":"723_CR41","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1287\/opre.48.6.915.12391","volume":"48","author":"F Vanderbeck","year":"2000","unstructured":"Vanderbeck F (2000) Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Oper Res 48(6):915\u2013926","journal-title":"Oper Res"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-020-00723-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-020-00723-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-020-00723-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T23:11:16Z","timestamp":1627341076000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-020-00723-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,27]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["723"],"URL":"https:\/\/doi.org\/10.1007\/s00186-020-00723-9","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2020,7,27]]},"assertion":[{"value":"21 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}