{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:29Z","timestamp":1740122429831,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:00:00Z","timestamp":1557792000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:00:00Z","timestamp":1557792000000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10898-019-00783-0","type":"journal-article","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T11:57:55Z","timestamp":1557835075000},"page":"417-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Facets of a mixed-integer bilinear covering set with bounds on variables"],"prefix":"10.1007","volume":"74","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":[[2019,5,14]]},"reference":[{"issue":"9","key":"783_CR1","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Dallwig, S., Floudas, C.A., Neumaier, A.: A global optimization method, $$\\alpha $$BB, for general twice-differentiable constrained NLPs\u2014I. Theoretical advances. Comput. Chem. Eng. 22(9), 1137\u20131158 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"783_CR2","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43, 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"key":"783_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10107-012-0602-3","volume":"136","author":"KM Anstreicher","year":"2012","unstructured":"Anstreicher, K.M.: On convex relaxations for quadratically constrained quadratic programming. Math. Program. B 136, 233\u2013251 (2012)","journal-title":"Math. Program. B"},{"key":"783_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10107-011-0462-2","volume":"129","author":"X Bao","year":"2011","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programming: a review and comparisons. Math. Program. B 129, 129\u2013157 (2011)","journal-title":"Math. Program. B"},{"issue":"4\u20135","key":"783_CR5","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., Waechter, A.: Branching and bounds tightening techniques for nonconvex MINLP. Optim. Methods Softw. 24(4\u20135), 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"783_CR6","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)"},{"key":"783_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, Berlin (2014)"},{"key":"783_CR8","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"JE Falk","year":"1969","unstructured":"Falk, J.E., Soland, R.M.: An algorithm for separable nonconvex programming problems. Manag. Sci. 15, 550\u2013569 (1969)","journal-title":"Manag. Sci."},{"key":"783_CR9","unstructured":"Forrest, J., Lougee-Heimerl, R.: CBC (Coin-or Branch-and-Cut) Solver. https:\/\/projects.coin-or.org\/Cbc . Accessed 18 Apr 2019"},{"key":"783_CR10","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.: CUTGEN1: a problem generator for the standard one-dimensional cutting stock problem. Eur. J. Oper. Res. 84, 572\u2013579 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"783_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid methods and its consequences in combinatorial optimization. Combinatorica 1, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"783_CR12","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.: Different transformations for solving nonconvex trim-loss problems by MINLP. Eur. J. Oper. Res. 105, 594\u2013603 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"783_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"GM Katta","year":"1987","unstructured":"Katta, G.M., Santosh, N.K.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39, 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"783_CR14","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\u2014Convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"783_CR15","unstructured":"Mitchell, S., Kean, A., Mason, A., O\u2019Sullivan, M., Phillips, A.: PuLP. (2011) https:\/\/www.coin-or.org\/PuLP\/ . Accessed 18 Apr 2019"},{"key":"783_CR16","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"783_CR17","first-page":"1","volume-title":"The Book Global Optimization and Constraint Satisfaction","author":"NV Sahinidis","year":"2003","unstructured":"Sahinidis, N.V.: Global optimization and constraint satisfaction: the branch-and-reduce approach. In: Bliek, C., Jermann, C., Neumaier, A. (eds.) The Book Global Optimization and Constraint Satisfaction, pp. 1\u201316. Springer, Berlin (2003)"},{"issue":"1","key":"783_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10479-006-0107-7","volume":"149","author":"HD Sherali","year":"2007","unstructured":"Sherali, H.D.: A unified approach for discrete and continuous nonconvex optimization. Ann. Oper. Res. 149(1), 185\u2013193 (2007)","journal-title":"Ann. Oper. Res."},{"key":"783_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali, H.D., Alameddin, A.R.: A new reformulation linearization technique for bilinear programming problems. J. Global Optim. 2, 379\u2013410 (1992)","journal-title":"J. Global Optim."},{"key":"783_CR20","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, J.P., Chung, K.: Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. Math. Program. B 124, 481\u2013512 (2010)","journal-title":"Math. Program. B"},{"key":"783_CR21","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.: One dimensional cutting stock problem to minimize the number of different patterns. Eur. J. Oper. Res. 146, 388\u2013402 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"783_CR22","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.: Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Oper. Res. 48(6), 915\u2013926 (2000)","journal-title":"Oper. Res."},{"key":"783_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(90)90100-C","volume":"36","author":"SA Vavasis","year":"1990","unstructured":"Vavasis, S.A.: Quadratic programming is in NP. Inf. Process. Lett. 36, 73\u201377 (1990)","journal-title":"Inf. Process. Lett."},{"key":"783_CR24","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1023\/A:1020383700229","volume":"24","author":"TV Voorhis","year":"2002","unstructured":"Voorhis, T.V.: A global optimization algorithm using Lagrangian underestimates and the interval Newton method. J. Global Optim. 24, 349\u2013370 (2002)","journal-title":"J. Global Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00783-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00783-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00783-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T15:21:14Z","timestamp":1694877674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00783-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,14]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["783"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00783-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2019,5,14]]},"assertion":[{"value":"6 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}