{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T23:21:23Z","timestamp":1770506483698,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,20]],"date-time":"2010-05-20T00:00:00Z","timestamp":1274313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s10107-010-0374-6","type":"journal-article","created":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T06:37:41Z","timestamp":1274251061000},"page":"481-512","source":"Crossref","is-referenced-by-count":30,"title":["Strong valid inequalities for orthogonal disjunctions and bilinear covering sets"],"prefix":"10.1007","volume":"124","author":[{"given":"Mohit","family":"Tawarmalani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Philippe P.","family":"Richard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwanghun","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,20]]},"reference":[{"key":"374_CR1","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1016\/S0098-1354(98)00218-X","volume":"22","author":"C.S. Adjiman","year":"1998","unstructured":"Adjiman C.S., Androulakis I.P., Floudas C.A.: A global optimization method, \u03b1BB, for general twice-differentiable constrained NLPs\u2014II. Implementation and computational results. Comput. Chem. Eng. 22, 1159\u20131179 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"374_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10107-006-0709-5","volume":"108","author":"A. Atamt\u00fcrk","year":"2006","unstructured":"Atamt\u00fcrk A.: Strong formulations of robust mixed 0\u20131 programming. Math. Program. 108, 235\u2013250 (2006)","journal-title":"Math. Program."},{"key":"374_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"Balas E.: Intersection cuts\u2014a new type of cutting planes for integer programming. Oper. Res. 19, 19\u201339 (1971)","journal-title":"Oper. Res."},{"key":"374_CR4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/B978-0-12-468650-2.50015-8","volume-title":"Nonlinear Programming","author":"E. Balas","year":"1975","unstructured":"Balas E.: Disjunctive programming: cutting planes from logical conditions. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds) Nonlinear Programming, pp. 279\u2013312. Academic Press, New York (1975)"},{"key":"374_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas E.: Disjunctive programming. Ann. Discret. Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discret. Math."},{"key":"374_CR6","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"Balas E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discret. Methods 6, 466\u2013486 (1985)","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"374_CR7","doi-asserted-by":"crossref","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discret. Appl. Math. 89(1\u20133), 3\u201344, original manuscript was published as a technical report in 1974 (1998)","DOI":"10.1016\/S0166-218X(98)00136-X"},{"key":"374_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10479-005-3969-1","volume":"140","author":"E. Balas","year":"2005","unstructured":"Balas E.: Projection, lifting and extended formulation in integer and combinatorial optimization. Ann. Oper. Res. 140, 125\u2013161 (2005)","journal-title":"Ann. Oper. Res."},{"key":"374_CR9","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E. Balas","year":"2003","unstructured":"Balas E., Perregaard M.: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed-integer gomory cuts for 0\u20131 programming. Math. Program. 94, 221\u2013245 (2003)","journal-title":"Math. Program."},{"key":"374_CR10","doi-asserted-by":"crossref","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\u2013324 (1993)","journal-title":"Math. Program."},{"key":"374_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10107-003-0432-4","volume":"99","author":"E. Balas","year":"2004","unstructured":"Balas E., Bockmayr A., Pisaruk N., Wolsey L.: On unions and dominants of polytopes. Math. Program. 99, 223\u2013239 (2004)","journal-title":"Math. Program."},{"key":"374_CR12","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., Waechter, A.: Branching and bounds tightening techniques for non-convex MINLP. http:\/\/www.optimization-online.org\/DB_HTML\/2008\/08\/2059.html (2008)"},{"key":"374_CR13","doi-asserted-by":"crossref","unstructured":"Bliek, C., Jermann, C., Neumaier, A. (eds.): Global Optimization and Constraint Satisfaction, 5th Annual Workshop on Global Constraint Optimization and Constraint Satisfaction, COCOS, Springer (2002)","DOI":"10.1007\/b94062"},{"key":"374_CR14","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S. Ceria","year":"1999","unstructured":"Ceria S., Soares J.: Convex programming for disjunctive convex optimization. Math. Program. 86, 595\u2013614 (1999)","journal-title":"Math. Program."},{"key":"374_CR15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W. Cook","year":"1990","unstructured":"Cook W., Kannan R., Schrijver A.: Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 47, 155\u2013174 (1990)","journal-title":"Math. Program."},{"key":"374_CR16","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10107-005-0670-8","volume":"106","author":"G. Cornu\u00e9jols","year":"2006","unstructured":"Cornu\u00e9jols G., Lemar\u00e9chal C.: A convex-analysis perspective on disjunctive cuts. Math. Program. 106, 567\u2013586 (2006)","journal-title":"Math. Program."},{"key":"374_CR17","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"J.E. 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":"374_CR18","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0925-7721(01)00032-3","volume":"20","author":"K. Fukuda","year":"2001","unstructured":"Fukuda K., Liebling T.M., L\u00fctolf C.: Extended convex hull. Comput. Geom. 20, 13\u201323 (2001)","journal-title":"Comput. Geom."},{"key":"374_CR19","doi-asserted-by":"crossref","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 non-convex trim-loss problems by MINLP. Eur. J. Oper. Res. 105, 594\u2013603 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"374_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R. Horst","year":"1996","unstructured":"Horst R., Tuy H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)","edition":"3"},{"key":"374_CR21","unstructured":"LINDO Systems Inc: LINGO 11.0 optimization modeling software for linear, nonlinear, and integer programming. http:\/\/www.lindo.com (2008)"},{"key":"374_CR22","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G.P. 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":"374_CR23","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1017\/CBO9780511569975.004","volume":"13","author":"A. Neumaier","year":"2004","unstructured":"Neumaier A.: Complete search in continuous global optimization and constraint satisfaction. Acta Numerica 13, 271\u2013369 (2004)","journal-title":"Acta Numerica"},{"key":"374_CR24","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"374_CR25","unstructured":"Sahinidis, N.V., Tawarmalani, M.: BARON. The Optimization Firm, LLC, Urbana-Champaign, IL. http:\/\/www.gams.com\/dd\/docs\/solvers\/baron.pdf (2005)"},{"key":"374_CR26","doi-asserted-by":"crossref","first-page":"1891","DOI":"10.1016\/j.compchemeng.2005.04.004","volume":"29","author":"N.W. Sawaya","year":"2005","unstructured":"Sawaya N.W., Grossmann I.E.: A cutting plane method for solving linear generalized disjunctive programming problems. Comput. Chem. Eng. 29, 1891\u20131913 (2005)","journal-title":"Comput. Chem. Eng."},{"key":"374_CR27","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1287\/opre.33.4.928","volume":"33","author":"H.D. Sherali","year":"1985","unstructured":"Sherali H.D., Sen S.: Cuts from combinatorial disjunctions. Oper. Res. 33, 928\u2013933 (1985)","journal-title":"Oper. Res."},{"key":"374_CR28","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"R. Stubbs","year":"1999","unstructured":"Stubbs R., Mehrotra S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86, 515\u2013532 (1999)","journal-title":"Math. Program."},{"key":"374_CR29","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011233805045","volume":"20","author":"M. Tawarmalani","year":"2001","unstructured":"Tawarmalani M., Sahinidis N.V.: Semidefinite relaxations of fractional programs via novel techniques for constructing convex envelopes of nonlinear functions. J. Glob. Optim. 20, 137\u2013158 (2001)","journal-title":"J. Glob. Optim."},{"key":"374_CR30","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"M. Tawarmalani","year":"2002","unstructured":"Tawarmalani M., Sahinidis N.V.: Convex extensions and envelopes of lower semi-continuous functions. Math. Program. 93, 247\u2013263 (2002)","journal-title":"Math. Program."},{"key":"374_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications","author":"M. Tawarmalani","year":"2002","unstructured":"Tawarmalani M., Sahinidis N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer, Dordrecht (2002)"},{"key":"374_CR32","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M. Tawarmalani","year":"2005","unstructured":"Tawarmalani M., Sahinidis N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"374_CR33","unstructured":"Tawarmalani, M., Richard, J.P.P., Chung, K.: Strong Valid Inequalities for Orthogonal Disjunctions and Polynomial Covering Sets, Technical Report, Krannert School of Management, Purdue University (2008)"},{"key":"374_CR34","volume-title":"Lectures on Polytopes","author":"G.M. Ziegler","year":"1998","unstructured":"Ziegler G.M.: Lectures on Polytopes. Springer, New York (1998)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0374-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0374-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0374-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:08Z","timestamp":1559123408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0374-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,20]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["374"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0374-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,20]]}}}