{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:27:50Z","timestamp":1780633670995,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T00:00:00Z","timestamp":1115078400000},"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":[[2005,6]]},"DOI":"10.1007\/s10107-005-0581-8","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T15:06:34Z","timestamp":1115132794000},"page":"225-249","source":"Crossref","is-referenced-by-count":1056,"title":["A polyhedral branch-and-cut approach to global optimization"],"prefix":"10.1007","volume":"103","author":[{"given":"Mohit","family":"Tawarmalani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,3]]},"reference":[{"key":"581_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s101079900106","volume":"87","author":"Audet","year":"2000","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G. : A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Prog. 87, 131\u2013152 (2000)","journal-title":"Math. Prog."},{"key":"581_CR2","doi-asserted-by":"crossref","unstructured":"Avriel, M., Diewert, W.E., Schaible, S., Zang, I.: Generalized Concavity. Plenum Press, 1988","DOI":"10.1007\/978-1-4684-7600-2"},{"key":"581_CR3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1214\/aoap\/1075828053","volume":"14","author":"Reitzner","year":"2004","unstructured":"B\u00f6r\u00f6czky K.Jr., Reitzner,M.: Approximation of smooth convex bodies by random circumscribed polytopes. Annals of Applied Probability 14, 239\u2013273 (2004)","journal-title":"Annals of Applied Probability"},{"key":"581_CR4","unstructured":"Bussieck, M.R.: MINLP World. http:\/\/www.gamsworld.org\/minlp\/index.htm 2002"},{"key":"581_CR5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1080\/1055678021000012480","volume":"17","author":"Chinneck","year":"2002","unstructured":"Chinneck, J.W.: Discovering the characteristics of mathematical programming via sampling. Optimization Methods and Software 17, 319\u2013352 (2002)","journal-title":"Optimization Methods and Software"},{"key":"581_CR6","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Prog. 36, 307\u2013339 (1986)","journal-title":"Math. Prog."},{"key":"581_CR7","unstructured":"Fourer, R., Mor\u00e9, J., Munson, T., Sarich, J.: Next-generation servers for optimization as an internet resource. Available at http:\/\/iems.nwu.edu\/~4er 2004"},{"key":"581_CR8","unstructured":"Griewank, A.: Evaluating derivatives. Principles and Techniques of Algorithmic Differentiation, vol 19 of Frontiers in Applied Mathematics. SIAM, Philadelphia, PA, 2000"},{"key":"581_CR9","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/mnsc.7.4.379","volume":"7","author":"Griffith","year":"1961","unstructured":"Griffith, R.E., Stewart, R.A.: A nonlinear programming technique for the optimization of continuous processing systems. Management Science 7, 379\u2013392 (1961)","journal-title":"Management Science"},{"key":"581_CR10","first-page":"521","volume":"5","author":"Gruber","year":"1993","unstructured":"Gruber, P.M.: Asymptotic estimates for best and stepwise approximation of convex bodies II. Forum Mathematicum 5, 521\u2013538 (1993)","journal-title":"Forum Mathematicum"},{"key":"581_CR11","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I. Springer-Verlag, Berlin, 1993","DOI":"10.1007\/978-3-662-02796-7"},{"key":"581_CR12","first-page":"703","volume":"8","author":"Kelley","year":"1960","unstructured":"Kelley, J.E.: The cutting plane method for solving convex programs. Journal of the SIAM 8, 703\u2013712 (1960)","journal-title":"Journal of the SIAM"},{"key":"581_CR13","unstructured":"Maheshwari, C., Neumaier, A., Schichl, H.: Convexity and concavity detection. Available at http:\/\/www.mat.univie.ac.at\/~herman\/techreports\/D12convconc.ps 2003"},{"key":"581_CR14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I\u2014Convex underestimating problems. Math. Prog. 10, 147\u2013175 (1976)","journal-title":"Math. Prog."},{"key":"581_CR15","unstructured":"Meeraus, A.: GLOBAL World. http:\/\/www.gamsworld.org\/global\/index.htm 2002"},{"key":"581_CR16","doi-asserted-by":"crossref","unstructured":"Nowak, I.: Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming. Habilitation thesis Humboldt-Universit\u00e4t zu Berlin, Germany, 2004","DOI":"10.1007\/3-7643-7374-1_4"},{"key":"581_CR17","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02238642","volume":"48","author":"Rote","year":"1992","unstructured":"Rote, G.: The convergence rate of the sandwich algorithm for approximating convex functions. Computing 48, 337\u2013361 (1992)","journal-title":"Computing"},{"key":"581_CR18","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011233805045","volume":"20","author":"Tawarmalani","year":"2001","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Semidefinite relaxations of fractional programs via novel techniques for constructing convex envelopes of nonlinear functions. Journal of Global Optimization 20, 137\u2013158 (2001)","journal-title":"Journal of Global Optimization"},{"key":"581_CR19","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convex extensions and convex envelopes of l.s.c. functions. Mathematical Programming 93, 247\u2013263 (2002)","journal-title":"s.c. functions. Mathematical Programming"},{"key":"581_CR20","doi-asserted-by":"crossref","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer Academic Publishers, Dordrecht, 2002","DOI":"10.1007\/978-1-4757-3532-1"},{"key":"581_CR21","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Math. Prog. 99, 563\u2013591 (2004)","journal-title":"Math. Prog."},{"key":"581_CR22","unstructured":"Vandenbussche, D.: Polyhedral Approaches to Solving Nonconvex Quadratic Programs. PhD thesis, Georgia Institute of Technology, Department of Indystrial and Systems Engineering, Atlanta, GA, 2003"},{"key":"581_CR23","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0098-1354(96)00346-8","volume":"22","author":"Zamora","year":"1998","unstructured":"Zamora, J.M., Grossmann, I.E.: A global MINLP optimization algorithm for the synthesis of heat exchanger networks with no stream splits. Computers & Chemical Engineering 22, 367\u2013384 (1998)","journal-title":"Computers & Chemical Engineering"},{"key":"581_CR24","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1008312714792","volume":"14","author":"Zamora","year":"1999","unstructured":"Zamora, J.M., Grossmann, I.E.: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms. Journal of Global Optimization 14, 217\u2013249 (1999)","journal-title":"Journal of Global Optimization"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0581-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-005-0581-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0581-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T09:37:47Z","timestamp":1625909867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-005-0581-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,3]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["581"],"URL":"https:\/\/doi.org\/10.1007\/s10107-005-0581-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5,3]]}}}