{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:54:39Z","timestamp":1772614479494,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,10,7]],"date-time":"2014-10-07T00:00:00Z","timestamp":1412640000000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10589-014-9690-8","type":"journal-article","created":{"date-parts":[[2014,10,6]],"date-time":"2014-10-06T14:22:51Z","timestamp":1412605371000},"page":"639-665","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Strong-branching inequalities for convex mixed integer nonlinear programs"],"prefix":"10.1007","volume":"59","author":[{"given":"Mustafa","family":"K\u0131l\u0131n\u00e7","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff","family":"Linderoth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Luedtke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,7]]},"reference":[{"key":"9690_CR1","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1287\/ijoc.1090.0373","volume":"22","author":"K Abhishek","year":"2010","unstructured":"Abhishek, K., Leyffer, S., Linderoth, J.T.: FilMINT: an outer-approximation-based solver for nonlinear mixed integer programs. INFORMS J. Comput. 22, 555\u2013567 (2010)","journal-title":"INFORMS J. Comput."},{"key":"9690_CR2","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. Thesis, Technischen Universt\u00e4t Berlin (2007)"},{"key":"9690_CR3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2004","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33, 42\u201354 (2004)","journal-title":"Oper. Res. Lett."},{"key":"9690_CR4","volume-title":"The Traveling Salesman Problem, A Computational Study","author":"D Applegate","year":"2006","unstructured":"Applegate, D., Bixby, R., Cook, W., Chv\u00e1tal, V.: The Traveling Salesman Problem, A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"9690_CR5","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","volume":"121","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk, A., Nemhauser, G., Savelsbergh, M.W.P.: Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121, 40\u201355 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9690_CR6","first-page":"19","volume":"79","author":"E Balas","year":"1997","unstructured":"Balas, E.: A modified lift-and-project procedure. Math. Program. 79, 19\u201331 (1997)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"9690_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discr. Appl. Math. 89(1\u20133), 3\u201344 (1998)","journal-title":"Discr. Appl. Math."},{"key":"9690_CR8","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":"9690_CR9","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework. Manag. Sci. 42, 1229\u20131246 (1996)","journal-title":"Manag. Sci."},{"key":"9690_CR10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","volume":"4","author":"E Balas","year":"1980","unstructured":"Balas, E., Jeroslow, R.G.: Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4, 224\u2013234 (1980)","journal-title":"Eur. J. Oper. Res."},{"key":"9690_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0962492913000032","volume":"22","author":"P Belotti","year":"2013","unstructured":"Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., Mahajan, A.: Mixed-integer nonlinear optimization. Acta Numer. 22, 1\u2013131 (2013)","journal-title":"Acta Numer."},{"key":"9690_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4614-1927-3_1","volume":"54","author":"P Bonami","year":"2012","unstructured":"Bonami, P., K\u0131l\u0131n\u00e7, M., Linderoth, J.: Algorithms and software for solving convex mixed integer nonlinear programs. IMA Vol. Math. Appl. 54, 1\u201340 (2012)","journal-title":"IMA Vol. Math. Appl."},{"key":"9690_CR13","unstructured":"Bonami, P., Lee, J., Leyffer, S., W\u00e4chter, A.: More branch-and-bound experiments in convex nonlinear integer programming. Preprint ANL\/MCS-P1949-0911, Argonne National Laboratory, Mathematics and Computer Science Division, September (2011)"},{"key":"9690_CR14","unstructured":"Boorstyn, R.R., Frank, H.: Large-scale network topological optimization. IEEE Trans. Commun. 25, 29\u201347 (1997)"},{"issue":"1","key":"9690_CR15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib - a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"key":"9690_CR16","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.compchemeng.2005.07.012","volume":"30","author":"I Castillo","year":"2005","unstructured":"Castillo, I., Westerlund, J., Emet, S., Westerlund, T.: Optimization of block layout deisgn problems with unequal areas: a comparison of MILP and MINLP optimization methods. Comput. Chem. Eng. 30, 54\u201369 (2005)","journal-title":"Comput. Chem. Eng."},{"key":"9690_CR17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"9690_CR18","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307\u2013339 (1986)","journal-title":"Math. Program."},{"issue":"1","key":"9690_CR19","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1287\/msom.1050.0094","volume":"8","author":"S Elhedhli","year":"2006","unstructured":"Elhedhli, S.: Service system design with immobile servers, stochastic demand, and congestion. Manuf. Serv. Oper. Manag. 8(1), 92\u201397 (2006)","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"9690_CR20","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Lodi, A., Tramontani, A.: On the separation of disjunctive cuts. Math. Programm. 128, 205\u2013230 (2011)","DOI":"10.1007\/s10107-009-0300-y"},{"key":"9690_CR21","unstructured":"Fletcher, R., Leyffer, S.: User manual for filterSQP. University of Dundee Numerical Analysis Report NA-181 (1998)"},{"key":"9690_CR22","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1021039126272","volume":"3","author":"IE Grossmann","year":"2002","unstructured":"Grossmann, I.E.: Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3, 227\u2013252 (2002)","journal-title":"Optim. Eng."},{"key":"9690_CR23","unstructured":"G\u00fcnl\u00fck, O., Lee, J., Weismantel, R.: MINLP strengthening for separaable convex quadratic transportation-cost ufl. Technical Report RC24213 (W0703\u2013042), IBM Research Division, March (2007)"},{"issue":"3","key":"9690_CR24","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/PL00011430","volume":"90","author":"O G\u00fcnl\u00fck","year":"2001","unstructured":"G\u00fcnl\u00fck, O., Pochet, Y.: Mixing mixed-integer inequalities. Math. Program. 90(3), 429\u2013457 (2001)","journal-title":"Math. Program."},{"key":"9690_CR25","doi-asserted-by":"crossref","first-page":"2190","DOI":"10.1007\/978-0-387-74759-0_387","volume-title":"Encyclopedia of Optimization","author":"I Harjunkoski","year":"2009","unstructured":"Harjunkoski, I., P\u00f6rn, R., Westerlund, T.: MINLP: Trim-loss problem. In: Floudas, Christodoulos A., Pardalos, Panos M. (eds.) Encyclopedia of Optimization, pp. 2190\u20132198. Springer, New York (2009)"},{"key":"9690_CR26","unstructured":"K\u0131l\u0131n\u00e7, M.: Disjunctive Cutting Planes and Algorithms for Convex Mixed Integer Nonlinear Programming. Ph.D. Thesis, University of Wisconsin-Madison (2011)"},{"key":"9690_CR27","unstructured":"Leyffer, S.: MacMINLP: Test Problems for Mixed Integer Nonlinear Programming, (2003). http:\/\/www.mcs.anl.gov\/~leyffer\/macminlp"},{"key":"9690_CR28","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"JT Linderoth","year":"1999","unstructured":"Linderoth, J.T., Savelsbergh, M.W.P.: A computational study of search strategies in mixed integer programming. INFORMS J. Comput. 11, 173\u2013187 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9690_CR29","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"GL Nemhauser","year":"1994","unstructured":"Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.C.: MINTO, a Mixed INTeger Optimizer. Oper. Res. Lett. 15, 47\u201358 (1994)","journal-title":"Oper. Res. Lett."},{"key":"9690_CR30","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/moor.18.4.767","volume":"18","author":"Y Pochet","year":"1993","unstructured":"Pochet, Y., Wolsey, L.: Lot sizing with constant batches: formulation and valid inequalities. Math. Oper. Res. 18, 767\u2013785 (1993)","journal-title":"Math. Oper. Res."},{"key":"9690_CR31","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I Quesada","year":"1992","unstructured":"Quesada, I., Grossmann, I.E.: An LP\/NLP based branch-and-bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16, 937\u2013947 (1992)","journal-title":"Comput. Chem. Eng."},{"issue":"1\u20132","key":"9690_CR32","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0098-1354(96)00357-2","volume":"22","author":"DE Ravemark","year":"1998","unstructured":"Ravemark, D.E., Rippin, D.W.T.: Optimal design of a multi-product batch plant. Comput. Chem. Eng. 22(1\u20132), 177\u2013183 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"9690_CR33","unstructured":"Sawaya, N.: Reformulations, relaxations and cutting planes for generalized disjunctive programming. Ph.D. Thesis, Chemical Engineering Department, Carnegie Mellon University (2006)"},{"key":"9690_CR34","unstructured":"Sawaya, N., Laird, C.D., Biegler, L.T., Bonami, P., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Lee, J., Lodi, A., Margot, F., W\u00e4chter, A.: CMU-IBM open source MINLP project test set, (2006). http:\/\/egon.cheme.cmu.edu\/ibm\/page.htm"},{"key":"9690_CR35","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10107-010-0371-9","volume":"124","author":"A Saxena","year":"2010","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. Math. Program. Ser. B 124, 383\u2013411 (2010)","journal-title":"Math. Program. Ser. B"},{"key":"9690_CR36","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."},{"issue":"8","key":"9690_CR37","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/0098-1354(95)00219-7","volume":"20","author":"M T\u00fcrkay","year":"1996","unstructured":"T\u00fcrkay, M., Grossmann, I.E.: Logic-based MINLP algorithms for the optimal synthesis of process networks. Comput. Chem. Eng. 20(8), 959\u2013978 (1996)","journal-title":"Comput. Chem. Eng."},{"issue":"4\u20135","key":"9690_CR38","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/S0098-1354(98)00293-2","volume":"23","author":"A Vecchietti","year":"1999","unstructured":"Vecchietti, A., Grossmann, I.E.: LOGMIP: a disjunctive 0\u20131 non-linear optimizer for process system models. Comput. Chem. Eng. 23(4\u20135), 555\u2013565 (1999)","journal-title":"Comput. Chem. Eng."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9690-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-014-9690-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9690-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T22:10:47Z","timestamp":1565907047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-014-9690-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,7]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["9690"],"URL":"https:\/\/doi.org\/10.1007\/s10589-014-9690-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,7]]}}}