{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T23:35:35Z","timestamp":1768088135366,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T00:00:00Z","timestamp":1656288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T00:00:00Z","timestamp":1656288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004489","name":"Mitacs","doi-asserted-by":"publisher","award":["FR37411"],"award-info":[{"award-number":["FR37411"]}],"id":[{"id":"10.13039\/501100004489","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10107-022-01844-1","type":"journal-article","created":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T18:59:08Z","timestamp":1656356348000},"page":"671-719","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Disjunctive cuts in Mixed-Integer Conic Optimization"],"prefix":"10.1007","volume":"199","author":[{"given":"Andrea","family":"Lodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9967-0578","authenticated-orcid":false,"given":"Mathieu","family":"Tanneau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan-Pablo","family":"Vielma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,27]]},"reference":[{"key":"1844_CR1","doi-asserted-by":"publisher","unstructured":"Andersen, K., Jensen, A.N.: Intersection cuts for mixed integer conic quadratic sets. In: M.\u00a0Goemans, J.\u00a0Correa (eds.) Integer Programming and Combinatorial Optimization, pp. 37\u201348. Springer Berlin Heidelberg, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36694-9_4","DOI":"10.1007\/978-3-642-36694-9_4"},{"issue":"1","key":"1844_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.: Conic mixed-integer rounding cuts. Math. Program. 122(1), 1\u201320 (2010). https:\/\/doi.org\/10.1007\/s10107-008-0239-4","journal-title":"Math. Program."},{"issue":"2","key":"1844_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-009-0282-9","volume":"126","author":"A Atamt\u00fcrk","year":"2011","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Lifting for conic mixed-integer programming. Math. Program. 126(2), 351\u2013363 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0282-9","journal-title":"Math. Program."},{"key":"1844_CR4","doi-asserted-by":"publisher","unstructured":"Balas, E.: Disjunctive programming. In: Hammer, P., Johnson, E., Korte, B. (eds.) Discrete Optimization II, Annals of Discrete Mathematics, vol. 5, pp. 3\u201351. Elsevier (1979). https:\/\/doi.org\/10.1016\/S0167-5060(08)70342-X","DOI":"10.1016\/S0167-5060(08)70342-X"},{"issue":"1","key":"1844_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.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58(1), 295\u2013324 (1993). https:\/\/doi.org\/10.1007\/BF01581273","journal-title":"Math. Program."},{"key":"1844_CR6","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.42.9.1229","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. Manage. Sci. (1996). https:\/\/doi.org\/10.1287\/mnsc.42.9.1229","journal-title":"Manage. Sci."},{"issue":"4","key":"1844_CR7","doi-asserted-by":"publisher","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(4), 224\u2013234 (1980). https:\/\/doi.org\/10.1016\/0377-2217(80)90106-X","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1844_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(01)00340-7","volume":"123","author":"E Balas","year":"2002","unstructured":"Balas, E., Perregaard, M.: Lift-and-project for mixed 0\u20131 programming: recent progress. Discret. Appl. Math. 123(1), 129\u2013154 (2002). https:\/\/doi.org\/10.1016\/S0166-218X(01)00340-7","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"1844_CR9","doi-asserted-by":"publisher","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(2), 221\u2013245 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0317-y","journal-title":"Math. Program."},{"key":"1844_CR10","doi-asserted-by":"crossref","unstructured":"Belotti, P., G\u00f3ez, J.C., P\u00f3lik, I., Ralphs, T.K., Terlaky, T.: A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization. In: Numerical Analysis and Optimization, pp. 1\u201335. Springer (2015)","DOI":"10.1007\/978-3-319-17689-5_1"},{"key":"1844_CR11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization. Society Industrial Applied Mathematics (2001). https:\/\/doi.org\/10.1137\/1.9780898718829","journal-title":"Society Industrial Applied Mathematics"},{"key":"1844_CR12","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.: Lift-and-project cuts for mixed integer convex programs. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) Integer Programming and Combinatoral Optimization, pp. 52\u201364. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20807-2_5"},{"issue":"2","key":"1844_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12532-012-0037-0","volume":"4","author":"P Bonami","year":"2012","unstructured":"Bonami, P.: On optimizing over lift-and-project closures. Math. Program. Comput. 4(2), 151\u2013179 (2012). https:\/\/doi.org\/10.1007\/s12532-012-0037-0","journal-title":"Math. Program. Comput."},{"issue":"2","key":"1844_CR14","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., et al.: An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2), 186\u2013204 (2008)","journal-title":"Discret. Optim."},{"key":"1844_CR15","first-page":"521","volume":"18","author":"P Bonami","year":"2011","unstructured":"Bonami, P., Linderoth, J., Lodi, A.: Disjunctive cuts for mixed integer nonlinear programming problems. Prog Combin Optim 18, 521\u2013541 (2011)","journal-title":"Prog Combin Optim"},{"issue":"1","key":"1844_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s13675-012-0006-4","volume":"1","author":"F Cadoux","year":"2013","unstructured":"Cadoux, F., Lemar\u00e9chal, C.: Reflections on generating (disjunctive) cuts. EURO J Computational Optimization 1(1), 51\u201369 (2013). https:\/\/doi.org\/10.1007\/s13675-012-0006-4","journal-title":"EURO J Computational Optimization"},{"issue":"3","key":"1844_CR17","doi-asserted-by":"publisher","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(3), 595\u2013614 (1999). https:\/\/doi.org\/10.1007\/s101070050106","journal-title":"Math. Program."},{"issue":"1","key":"1844_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-005-0578-3","volume":"104","author":"M \u00c7ezik","year":"2005","unstructured":"\u00c7ezik, M., Iyengar, G.: Cuts for mixed 0\u20131 conic programming. Math. Program. 104(1), 179\u2013202 (2005). https:\/\/doi.org\/10.1007\/s10107-005-0578-3","journal-title":"Math. Program."},{"key":"1844_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s12532-020-00178-3","volume":"12","author":"C Coey","year":"2020","unstructured":"Coey, C., Lubin, M., Vielma, J.P.: Outer approximation with conic certificates for mixed-integer convex problems. Math. Program. Comput. 12, 249\u2013293 (2020)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"1844_CR20","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-018-1299-8","volume":"178","author":"M Conforti","year":"2019","unstructured":"Conforti, M., Wolsey, L.A.: Facet separation with one linear program. Math. Program. 178(1), 361\u2013380 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1299-8","journal-title":"Math. Program."},{"issue":"2","key":"1844_CR21","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, S., Vielma, J.: The split closure of a strictly convex body. Oper. Res. Lett. 39(2), 121\u2013126 (2011). https:\/\/doi.org\/10.1016\/j.orl.2011.02.002","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1844_CR22","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36(3), 307\u2013339 (1986). https:\/\/doi.org\/10.1007\/BF02592064","journal-title":"Math. Program."},{"issue":"1","key":"1844_CR23","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10107-009-0300-y","volume":"128","author":"M Fischetti","year":"2011","unstructured":"Fischetti, M., Lodi, A., Tramontani, A.: On the separation of disjunctive cuts. Math. Program. 128(1), 205\u2013230 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0300-y","journal-title":"Math. Program."},{"issue":"2","key":"1844_CR24","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s12532-015-0092-4","volume":"8","author":"HA Friberg","year":"2016","unstructured":"Friberg, H.A.: Cblib 2014: a benchmark library for conic mixed-integer and continuous optimization. Math. Program. Comput. 8(2), 191\u2013214 (2016). https:\/\/doi.org\/10.1007\/s12532-015-0092-4","journal-title":"Math. Program. Comput."},{"key":"1844_CR25","unstructured":"Friberg, H.A.: Facial reduction heuristics and the motivational example of mixed-integer conic optimization. Tech. rep. (2016). http:\/\/www.optimization-online.org\/DB_FILE\/2016\/02\/5324.pdf"},{"issue":"11","key":"1844_CR26","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1287\/mnsc.16.11.676","volume":"16","author":"AM Geoffrion","year":"1970","unstructured":"Geoffrion, A.M.: Elements of large-scale mathematical programming. Manage. Sci. 16(11), 676\u2013691 (1970)","journal-title":"Manage. Sci."},{"key":"1844_CR27","first-page":"155","volume-title":"Global Optimization, Nonconvex Optimization and Its Applications","author":"M Grant","year":"2006","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti, L., Maculan, N. (eds.) Global Optimization, Nonconvex Optimization and Its Applications, vol. 84, pp. 155\u2013210. Springer, US (2006)"},{"key":"1844_CR28","unstructured":"Gurobi\u00a0Optimization, L.: Gurobi optimizer reference manual (2018). https:\/\/www.gurobi.com"},{"key":"1844_CR29","unstructured":"IBM: IBM ILOG CPLEX Optimization Studio. https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio"},{"key":"1844_CR30","doi-asserted-by":"publisher","unstructured":"Kazachkov, A.: Non-Recursive Cut Generation. Ph.D. thesis, Carnegie Mellon University (2018). https:\/\/doi.org\/10.1184\/R1\/6720881.v1","DOI":"10.1184\/R1\/6720881.v1"},{"issue":"4","key":"1844_CR31","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s12532-017-0118-1","volume":"9","author":"MR K\u0131l\u0131n\u00e7","year":"2017","unstructured":"K\u0131l\u0131n\u00e7, M.R., Linderoth, J., Luedtke, J.: Lift-and-project cuts for convex mixed integer nonlinear programs. Math. Program. Comput. 9(4), 499\u2013526 (2017). https:\/\/doi.org\/10.1007\/s12532-017-0118-1","journal-title":"Math. Program. Comput."},{"issue":"1","key":"1844_CR32","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s10107-015-0968-0","volume":"159","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2016","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F., Steffy, D.E.: On sublinear inequalities for mixed integer conic programs. Math. Program. 159(1), 585\u2013605 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0968-0","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1844_CR33","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10107-015-0903-4","volume":"154","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2015","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F., Y\u0131ld\u0131z, S.: Two-term disjunctions on the second-order cone. Math. Program. 154(1\u20132), 463\u2013491 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0903-4","journal-title":"Math. Program."},{"issue":"2","key":"1844_CR34","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1287\/moor.2015.0737","volume":"41","author":"F Kilin\u00e7-Karzan","year":"2015","unstructured":"Kilin\u00e7-Karzan, F.: On Minimal Valid Inequalities for Mixed Integer Conic Programs. Math. Oper. Res. 41(2), 477\u2013510 (2015). https:\/\/doi.org\/10.1287\/moor.2015.0737","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1844_CR35","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s11081-018-9411-8","volume":"20","author":"J Kronqvist","year":"2019","unstructured":"Kronqvist, J., Bernal, D.E., Lundell, A., Grossmann, I.E.: A review and comparison of solvers for convex MINLP. Optim. Eng. 20(2), 397\u2013455 (2019). https:\/\/doi.org\/10.1007\/s11081-018-9411-8","journal-title":"Optim. Eng."},{"key":"1844_CR36","doi-asserted-by":"publisher","unstructured":"Kronqvist, J., Misener, R.: A disjunctive cut strengthening technique for convex minlp. Optimization and Engineering, pp. 1\u201331 (2020). https:\/\/doi.org\/10.1007\/s11081-020-09551-6","DOI":"10.1007\/s11081-020-09551-6"},{"key":"1844_CR37","doi-asserted-by":"publisher","unstructured":"Legat, B., Dowson, O., Garcia, J.D., Lubin, M.: MathOptInterface: a data structure for mathematical optimization problems. INFORMS J. Comput. (2020). https:\/\/doi.org\/10.1287\/ijoc.2021.1067","DOI":"10.1287\/ijoc.2021.1067"},{"key":"1844_CR38","doi-asserted-by":"crossref","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Extended Formulations in Mixed-Integer Convex Programming. In: Louveaux, Q., Skutella, M. (eds.) Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (IPCO 2016), Lecture Notes in Computer Science, vol. 9682, pp. 102\u2013113 (2016)","DOI":"10.1007\/978-3-319-33461-5_9"},{"issue":"1","key":"1844_CR39","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10107-017-1191-y","volume":"172","author":"M Lubin","year":"2018","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Polyhedral approximation in mixed-integer convex optimization. Math. Program. 172(1), 139\u2013168 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1191-y","journal-title":"Math. Program."},{"key":"1844_CR40","unstructured":"Modaresi, S.: Valid inequalities and reformulation techniques for mixed integer nonlinear programming. Ph.D. thesis, University of Pittsburgh (2016)"},{"issue":"1","key":"1844_CR41","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, M.R., Vielma, J.P.: Split cuts and extended formulations for mixed integer conic quadratic programming. Oper. Res. Lett. 43(1), 10\u201315 (2015). https:\/\/doi.org\/10.1016\/j.orl.2014.10.006","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1844_CR42","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, M.R., Vielma, J.P.: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets. Math. Program. 155(1), 575\u2013611 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0866-5","journal-title":"Math. Program."},{"key":"1844_CR43","unstructured":"MOSEK ApS: The MOSEK Optimization Suite. https:\/\/www.mosek.com\/"},{"key":"1844_CR44","unstructured":"MOSEK ApS: Mosek modeling cookbook (2020). https:\/\/docs.mosek.com\/modeling-cookbook\/index.html"},{"key":"1844_CR45","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45535-3_27","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Perregaard","year":"2001","unstructured":"Perregaard, M., Balas, E.: Generating cuts from multiple-term disjunctions. In: Aardal, K., Gerards, B. (eds.) Integer Programming and Combinatorial Optimization, pp. 348\u2013360. Springer, Berlin Heidelberg, Berlin, Heidelberg (2001)"},{"key":"1844_CR46","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex analysis, vol.\u00a028. Princeton university press (1970)","DOI":"10.1515\/9781400873173"},{"key":"1844_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-020-03709-2","author":"T Serra","year":"2020","unstructured":"Serra, T.: Reformulating the disjunctive cut generating linear program. Ann. Oper. Res. (2020). https:\/\/doi.org\/10.1007\/s10479-020-03709-2","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"1844_CR48","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86(3), 515\u2013532 (1999). https:\/\/doi.org\/10.1007\/s101070050103","journal-title":"Math. Program."},{"key":"1844_CR49","doi-asserted-by":"crossref","unstructured":"Trespalacios, F., Grossmann, I.E.: Review of Mixed-Integer Nonlinear and Generalized Disjunctive Programming Methods (2014). https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/cite.201400037","DOI":"10.1002\/cite.201400037"},{"issue":"2","key":"1844_CR50","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/ijoc.2015.0669","volume":"28","author":"F Trespalacios","year":"2016","unstructured":"Trespalacios, F., Grossmann, I.E.: Cutting plane algorithm for convex generalized disjunctive programs. INFORMS J. Comput. 28(2), 209\u2013222 (2016). https:\/\/doi.org\/10.1287\/ijoc.2015.0669","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"1844_CR51","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.orl.2015.06.001","volume":"43","author":"S Yildiz","year":"2015","unstructured":"Yildiz, S., Cornu\u00e9jols, G.: Disjunctive cuts for cross-sections of the second-order cone. Oper. Res. Lett. 43(4), 432\u2013437 (2015). https:\/\/doi.org\/10.1016\/j.orl.2015.06.001","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1844_CR52","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1021\/ie0402719","volume":"45","author":"Y Zhu","year":"2006","unstructured":"Zhu, Y., Kuno, T.: A disjunctive cutting-plane-based branch-and-cut algorithm for 0\u20131 mixed-integer convex nonlinear programs. Industrial & engineering chemistry research 45(1), 187\u2013196 (2006)","journal-title":"Industrial & engineering chemistry research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01844-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01844-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01844-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T17:32:51Z","timestamp":1682098371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01844-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,27]]},"references-count":52,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1844"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01844-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,27]]},"assertion":[{"value":"5 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}