{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T12:00:01Z","timestamp":1775908801149,"version":"3.50.1"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T00:00:00Z","timestamp":1626480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T00:00:00Z","timestamp":1626480000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Research Campus MODAL","award":["05M14ZA"],"award-info":[{"award-number":["05M14ZA"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The most important ingredient for solving mixed-integer nonlinear programs (MINLPs) to global <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\epsilon $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03f5<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-optimality with spatial branch and bound is a tight, computationally tractable relaxation. Due to both theoretical and practical considerations, relaxations of MINLPs are usually required to be convex. Nonetheless, current optimization solvers can often successfully handle a moderate presence of nonconvexities, which opens the door for the use of potentially tighter nonconvex relaxations. In this work, we exploit this fact and make use of a nonconvex relaxation obtained via aggregation of constraints: a <jats:italic>surrogate<\/jats:italic> relaxation. These relaxations were actively studied for linear integer programs in the 70s and 80s, but they have been scarcely considered since. We revisit these relaxations in an MINLP setting and show the computational benefits and challenges they can have. Additionally, we study a generalization of such relaxation that allows for multiple aggregations simultaneously and present the first algorithm that is capable of computing the best set of aggregations. We propose a multitude of computational enhancements for improving its practical performance and evaluate the algorithm\u2019s ability to generate strong dual bounds through extensive computational experiments.\n<\/jats:p>","DOI":"10.1007\/s10107-021-01691-6","type":"journal-article","created":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T09:02:57Z","timestamp":1626512577000},"page":"89-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On generalized surrogate duality in mixed-integer nonlinear programming"],"prefix":"10.1007","volume":"192","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4463-2873","authenticated-orcid":false,"given":"Benjamin","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Mu\u00f1oz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Gasse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felipe","family":"Serrano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,17]]},"reference":[{"key":"1691_CR1","doi-asserted-by":"publisher","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007). https:\/\/doi.org\/10.14279\/depositonce-1634, http:\/\/nbn-resolving.de\/urn:nbn:de:kobv:83-opus-16117","DOI":"10.14279\/depositonce-1634"},{"key":"1691_CR2","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-38189-8_18","volume-title":"Facets of combinatorial optimization","author":"T Achterberg","year":"2013","unstructured":"Achterberg, T., Wunderling, R.: Mixed integer programming: analyzing 12 years of progress. In: J\u00fcnger, M., Reinelt, G. (eds.) Facets of combinatorial optimization, pp. 449\u2013481. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-642-38189-8_18"},{"issue":"2","key":"1691_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ejor.2013.04.023","volume":"232","author":"B Alidaee","year":"2014","unstructured":"Alidaee, B.: Zero duality gap in surrogate constraint optimization: a concise review of models. Eur. J. Oper. Res. 232(2), 241\u2013248 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2013.04.023","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"1691_CR4","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.dam.2008.06.021","volume":"157","author":"HMB Amor","year":"2009","unstructured":"Amor, H.M.B., Desrosiers, J., Frangioni, A.: On the choice of explicit stabilizing terms in column generation. Discrete Appl. Math. 157(6), 1167\u20131184 (2009). https:\/\/doi.org\/10.1016\/j.dam.2008.06.021","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"1691_CR5","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1287\/opre.15.5.915","volume":"15","author":"E Balas","year":"1967","unstructured":"Balas, E.: Discrete programming by the filter method. Oper. Res. 15(5), 915\u2013957 (1967). https:\/\/doi.org\/10.1287\/opre.15.5.915","journal-title":"Oper. Res."},{"issue":"1\u20133","key":"1691_CR6","doi-asserted-by":"publisher","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. Discrete Appl. Math. 89(1\u20133), 3\u201344 (1998). https:\/\/doi.org\/10.1016\/s0166-218X(98)00136-X","journal-title":"Discrete Appl. Math."},{"key":"1691_CR7","unstructured":"Banerjee, K.: Generalized Lagrange multipliers in dynamic programming. Ph.D. thesis, University of California, Berkeley (1971)"},{"key":"1691_CR8","unstructured":"Belotti, P., Cafieri, S., Lee, J., Liberti, L.: On feasibility based bounds tightening. Technical Report 3325, Optimization Online (2012). http:\/\/www.optimization-online.org\/DB_HTML\/2012\/01\/3325.html"},{"issue":"1","key":"1691_CR9","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M Benichou","year":"1971","unstructured":"Benichou, M., Gauthier, J.M., Girodet, P., Hentges, G., Ribiere, G., Vincent, O.: Experiments in mixed-integer linear programming. Math. Program. 1(1), 76\u201394 (1971). https:\/\/doi.org\/10.1007\/BF01584074","journal-title":"Math. Program."},{"issue":"1","key":"1691_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-015-0891-4","volume":"151","author":"P Bonami","year":"2015","unstructured":"Bonami, P., Lodi, A., Tramontani, A., Wiese, S.: On mathematical programming with indicator constraints. Math. Program. 151(1), 191\u2013223 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0891-4","journal-title":"Math. Program."},{"key":"1691_CR11","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2018.1556661","author":"R Burlacu","year":"2019","unstructured":"Burlacu, R., Gei\u00dfler, B., Schewe, L.: Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes. Optim. Methods Softw. (2019). https:\/\/doi.org\/10.1080\/10556788.2018.1556661","journal-title":"Optim. Methods Softw."},{"key":"1691_CR12","unstructured":"COIN-OR: CppAD, a package for differentiation of C++ algorithms. http:\/\/www.coin-or.org\/CppAD"},{"key":"1691_CR13","unstructured":"COIN-OR: Ipopt, interior point optimizer. http:\/\/www.coin-or.org\/Ipopt"},{"key":"1691_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust Region Methods. Society for Industrial and Applied Mathematics, University City (2000). https:\/\/doi.org\/10.1137\/1.9780898719857"},{"issue":"5","key":"1691_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0167-6377(88)90041-7","volume":"7","author":"M Djerdjour","year":"1988","unstructured":"Djerdjour, M., Mathur, K., Salkin, H.M.: A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem. Oper. Res. Lett. 7(5), 253\u2013258 (1988). https:\/\/doi.org\/10.1016\/0167-6377(88)90041-7","journal-title":"Oper. Res. Lett."},{"issue":"1\u20133","key":"1691_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/s0012-365X(98)00213-1","volume":"194","author":"O du Merle","year":"1999","unstructured":"du Merle, O., Villeneuve, D., Desrosiers, J., Hansen, P.: Stabilized column generation. Discrete Math. 194(1\u20133), 229\u2013237 (1999). https:\/\/doi.org\/10.1016\/s0012-365X(98)00213-1","journal-title":"Discrete Math."},{"issue":"1","key":"1691_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01581647","volume":"19","author":"ME Dyer","year":"1980","unstructured":"Dyer, M.E.: Calculating surrogate constraints. Math. Program. 19(1), 255\u2013278 (1980). https:\/\/doi.org\/10.1007\/BF01581647","journal-title":"Math. Program."},{"issue":"1","key":"1691_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0166-218(83)990016-1","volume":"5","author":"M Fisher","year":"1983","unstructured":"Fisher, M., Lageweg, B., Lenstra, J., Kan, A.: Surrogate duality relaxation for job shop scheduling. Discrete Appl. Math. 5(1), 65\u201375 (1983). https:\/\/doi.org\/10.1016\/0166-218(83)990016-1","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"1691_CR19","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BF02591863","volume":"31","author":"B Gavish","year":"1985","unstructured":"Gavish, B., Pirkul, H.: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality. Math. Program. 31(1), 78\u2013105 (1985). https:\/\/doi.org\/10.1007\/BF02591863","journal-title":"Math. Program."},{"key":"1691_CR20","doi-asserted-by":"publisher","unstructured":"Geoffrion, A.M.: Implicit enumeration using an imbedded linear program. Technical report (1967). https:\/\/doi.org\/10.21236\/ad0655444","DOI":"10.21236\/ad0655444"},{"issue":"6","key":"1691_CR21","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F Glover","year":"1965","unstructured":"Glover, F.: A multiphase-dual algorithm for the zero-one integer programming problem. Oper. Res. 13(6), 879\u2013919 (1965). https:\/\/doi.org\/10.1287\/opre.13.6.879","journal-title":"Oper. Res."},{"issue":"4","key":"1691_CR22","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1287\/opre.16.4.741","volume":"16","author":"F Glover","year":"1968","unstructured":"Glover, F.: Surrogate constraints. Oper. Res. 16(4), 741\u2013749 (1968). https:\/\/doi.org\/10.1287\/opre.16.4.741","journal-title":"Oper. Res."},{"issue":"3","key":"1691_CR23","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1287\/opre.23.3.434","volume":"23","author":"F Glover","year":"1975","unstructured":"Glover, F.: Surrogate constraint duality in mathematical programming. Oper. Res. 23(3), 434\u2013451 (1975). https:\/\/doi.org\/10.1287\/opre.23.3.434","journal-title":"Oper. Res."},{"issue":"1","key":"1691_CR24","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156\u2013166 (1977). https:\/\/doi.org\/10.1111\/j.1540-5915.1977.tb01074.x","journal-title":"Decis. Sci."},{"issue":"3","key":"1691_CR25","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1023721723676","volume":"9","author":"F Glover","year":"2003","unstructured":"Glover, F.: Tutorial on surrogate constraint approaches for optimization in graphs. J. Heuristics 9(3), 175\u2013227 (2003). https:\/\/doi.org\/10.1023\/A:1023721723676","journal-title":"J. Heuristics"},{"key":"1691_CR26","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report P-1885, The RAND Corporation (1960)"},{"issue":"5","key":"1691_CR27","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"HJ Greenberg","year":"1970","unstructured":"Greenberg, H.J., Pierskalla, W.P.: Surrogate mathematical programming. Oper. Res. 18(5), 924\u2013939 (1970). https:\/\/doi.org\/10.1287\/opre.18.5.924","journal-title":"Oper. Res."},{"key":"1691_CR28","unstructured":"Grossmann, I.E., Sahinidis, N.V.: Special issue on mixed integer programming and its application to engineering, part I. Optim. Eng. 3(4) (2002)"},{"key":"1691_CR29","unstructured":"Hendel, G.: Empirical analysis of solving phases in mixed integer programming. Master\u2019s thesis, Technische Universit\u00e4t Berlin (2014). http:\/\/nbn-resolving.de\/urn:nbn:de:0297-zib-54270"},{"key":"1691_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization. Springer, Berlin (1996). https:\/\/doi.org\/10.1007\/978-3-662-03199-5"},{"key":"1691_CR31","unstructured":"ILOG, I.: ILOG CPLEX: High-performance software for mathematical programming and optimization. http:\/\/www.ilog.com\/products\/cplex\/"},{"issue":"4","key":"1691_CR32","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley Jr.","year":"1960","unstructured":"Kelley, J.E., Jr.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8(4), 703\u2013712 (1960). https:\/\/doi.org\/10.1137\/0108053","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"1691_CR33","unstructured":"Junttila, T., Kaski, P.: bliss: A tool for computing automorphism groups and canonical labelings of graphs. http:\/\/www.tcs.hut.fi\/Software\/bliss\/ (2012)"},{"key":"1691_CR34","unstructured":"Karwan, M.H.: Surrogate constraint duality and extensions in integer programming. Ph.D. thesis, Georgia Institute of Technology (1976)"},{"issue":"1","key":"1691_CR35","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01588253","volume":"17","author":"MH Karwan","year":"1979","unstructured":"Karwan, M.H., Rardin, R.L.: Some relationships between Lagrangian and surrogate duality in integer programming. Math. Program. 17(1), 320\u2013334 (1979). https:\/\/doi.org\/10.1007\/BF01588253","journal-title":"Math. Program."},{"issue":"5","key":"1691_CR36","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1287\/opre.28.5.1251","volume":"28","author":"MH Karwan","year":"1980","unstructured":"Karwan, M.H., Rardin, R.L.: Searchability of the composite and multiple surrogate dual functions. Oper. Res. 28(5), 1251\u20131257 (1980). https:\/\/doi.org\/10.1287\/opre.28.5.1251","journal-title":"Oper. Res."},{"issue":"1","key":"1691_CR37","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/nav.3800280107","volume":"28","author":"MH Karwan","year":"1981","unstructured":"Karwan, M.H., Rardin, R.L.: Surrogate duality in a branch-and-bound procedure. Naval Res. Logist. Q. 28(1), 93\u2013101 (1981). https:\/\/doi.org\/10.1002\/nav.3800280107","journal-title":"Naval Res. Logist. Q."},{"issue":"1","key":"1691_CR38","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/opre.32.1.52","volume":"32","author":"MH Karwan","year":"1984","unstructured":"Karwan, M.H., Rardin, R.L.: Surrogate dual multiplier search procedures in integer programming. Oper. Res. 32(1), 52\u201369 (1984). https:\/\/doi.org\/10.1287\/opre.32.1.52","journal-title":"Oper. Res."},{"issue":"2","key":"1691_CR39","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1022622231801","volume":"96","author":"SL Kim","year":"1998","unstructured":"Kim, S.L., Kim, S.: Exact algorithm for the surrogate dual of an integer programming problem: subgradient method approach. J. Optim. Theory Appl. 96(2), 363\u2013375 (1998). https:\/\/doi.org\/10.1023\/A:1022622231801","journal-title":"J. Optim. Theory Appl."},{"key":"1691_CR40","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-540-68279-0_17","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"F Margot","year":"2009","unstructured":"Margot, F.: Symmetry in integer linear programming. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 647\u2013686. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_17"},{"issue":"1","key":"1691_CR41","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(1), 147\u2013175 (1976). https:\/\/doi.org\/10.1007\/BF01580665","journal-title":"Math. Program."},{"key":"1691_CR42","unstructured":"MINLP library. http:\/\/www.minlplib.org\/"},{"issue":"2\u20133","key":"1691_CR43","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: Algorithms for coNTinuous\/integer global optimization of nonlinear equations. J. Global Optim. 59(2\u20133), 503\u2013526 (2014). https:\/\/doi.org\/10.1007\/s10898-014-0166-2","journal-title":"J. Global Optim."},{"key":"1691_CR44","unstructured":"MUMPS: Multifrontal massively parallel sparse direct solver. http:\/\/mumps.enseeiht.fr"},{"issue":"2","key":"1691_CR45","doi-asserted-by":"publisher","first-page":"145","DOI":"10.15807\/jorsj.46.145","volume":"46","author":"Y Nakagawa","year":"2003","unstructured":"Nakagawa, Y.: An improved surrogate constraints method for separable nonlinear integer programming. J. Oper. Res. Soc. Jpn. 46(2), 145\u2013163 (2003). https:\/\/doi.org\/10.15807\/jorsj.46.145","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"1","key":"1691_CR46","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/s0377-2217(98)00038-1","volume":"114","author":"MG Narciso","year":"1999","unstructured":"Narciso, M.G., Lorena, L.A.N.: Lagrangean\/surrogate relaxation for generalized assignment problems. Eur. J. Oper. Res. 114(1), 165\u2013177 (1999). https:\/\/doi.org\/10.1016\/s0377-2217(98)00038-1","journal-title":"Eur. J. Oper. Res."},{"key":"1691_CR47","unstructured":"Neame, P.J.: Nonsmooth dual methods in integer programming. Ph.D. thesis, University of Melbourne, Department of Mathematics and Statistics (2000)"},{"issue":"1\u20133","key":"1691_CR48","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"GL Nemhauser","year":"1990","unstructured":"Nemhauser, G.L., Wolsey, L.A.: A recursive procedure to generate all cuts for 0\u20131 mixed integer programs. Math. Program. 46(1\u20133), 379\u2013390 (1990). https:\/\/doi.org\/10.1007\/BF01585752","journal-title":"Math. Program."},{"issue":"6","key":"1691_CR49","doi-asserted-by":"publisher","first-page":"1994","DOI":"10.1137\/s0363012902327819","volume":"42","author":"JP Penot","year":"2004","unstructured":"Penot, J.P., Volle, M.: Surrogate programming and multipliers in quasi-convex programming. SIAM J. Control Optim. 42(6), 1994\u20132003 (2004). https:\/\/doi.org\/10.1137\/s0363012902327819","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"1691_CR50","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1021\/ie00015a012","volume":"32","author":"I Quesada","year":"1993","unstructured":"Quesada, I., Grossmann, I.E.: Global optimization algorithm for heat exchanger networks. Ind. Eng. Chem. Res. 32(3), 487\u2013499 (1993). https:\/\/doi.org\/10.1021\/ie00015a012","journal-title":"Ind. Eng. Chem. Res."},{"issue":"1","key":"1691_CR51","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01106605","volume":"6","author":"I Quesada","year":"1995","unstructured":"Quesada, I., Grossmann, I.E.: A global optimization algorithm for linear fractional and bilinear programs. J. Global Optim. 6(1), 39\u201376 (1995). https:\/\/doi.org\/10.1007\/BF01106605","journal-title":"J. Global Optim."},{"issue":"5","key":"1691_CR52","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"H Ryoo","year":"1995","unstructured":"Ryoo, H., Sahinidis, N.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551\u2013566 (1995). https:\/\/doi.org\/10.1016\/0098-1354(94)00097-2","journal-title":"Comput. Chem. Eng."},{"key":"1691_CR53","doi-asserted-by":"publisher","unstructured":"Sarin, S., Karwan, M.H., Rardin, R.L.: A new surrogate dual multiplier search procedure. Naval Res. Logist. 34(3), 431\u2013450 (1987). https:\/\/doi.org\/10.1002\/1520-6750(198706)34:3<365::AID-NAV3220340305>3.0.CO;2-P","DOI":"10.1002\/1520-6750(198706)34:3<365::AID-NAV3220340305>3.0.CO;2-P"},{"issue":"3","key":"1691_CR54","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/0377-2217(88)90176-2","volume":"33","author":"S Sarin","year":"1988","unstructured":"Sarin, S., Karwan, M.H., Rardin, R.L.: Surrogate duality in a branch-and-bound procedure for integer programming. Eur. J. Oper. Res. 33(3), 326\u2013333 (1988). https:\/\/doi.org\/10.1016\/0377-2217(88)90176-2","journal-title":"Eur. J. Oper. Res."},{"key":"1691_CR55","unstructured":"SCIP\u2014solving constraint integer programs. http:\/\/scip.zib.de"},{"key":"1691_CR56","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"1999","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-1-4757-4388-3"},{"issue":"1\/4","key":"1691_CR57","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1013819515732","volume":"22","author":"HD Sherali","year":"2002","unstructured":"Sherali, H.D., Fraticelli, B.M.P.: Enhancing RLT relaxations via a new class of semidefinite cuts. J. Global Optim. 22(1\/4), 233\u2013261 (2002). https:\/\/doi.org\/10.1023\/A:1013819515732","journal-title":"J. Global Optim."},{"issue":"2","key":"1691_CR58","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/s10957-011-9893-4","volume":"152","author":"S Suzuki","year":"2011","unstructured":"Suzuki, S., Kuroiwa, D.: Necessary and sufficient constraint qualification for surrogate duality. J. Optim. Theory Appl. 152(2), 366\u2013377 (2011). https:\/\/doi.org\/10.1007\/s10957-011-9893-4","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1691_CR59","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1080\/03052158708941094","volume":"12","author":"AB Templeman","year":"1987","unstructured":"Templeman, A.B., Xingsi, L.: A maximum entropy approach to constrained non-linear programming. Eng. Optim. 12(3), 191\u2013205 (1987). https:\/\/doi.org\/10.1080\/03052158708941094","journal-title":"Eng. Optim."},{"issue":"3","key":"1691_CR60","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/10589-016-9851-z","volume":"65","author":"W van Ackooij","year":"2016","unstructured":"van Ackooij, W., Frangioni, A., de Oliveira, W.: Inexact stabilized benders\u2019 decomposition approaches with application to chance-constrained problems with finite support. Comput. Optim. Appl. 65(3), 637\u2013669 (2016). https:\/\/doi.org\/10.1007\/10589-016-9851-z","journal-title":"Comput. Optim. Appl."},{"issue":"10","key":"1691_CR61","doi-asserted-by":"publisher","first-page":"4721","DOI":"10.1287\/mnsc.2017.2856","volume":"64","author":"JP Vielma","year":"2018","unstructured":"Vielma, J.P.: Embedding formulations and complexity for unions of polyhedra. Manag. Sci. 64(10), 4721\u20134734 (2018). https:\/\/doi.org\/10.1287\/mnsc.2017.2856","journal-title":"Manag. Sci."},{"issue":"1\u20132","key":"1691_CR62","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10107-018-1258-4","volume":"177","author":"JP Vielma","year":"2018","unstructured":"Vielma, J.P.: Small and strong formulations for unions of convex sets from the Cayley embedding. Math. Program. 177(1\u20132), 21\u201353 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1258-4","journal-title":"Math. Program."},{"key":"1691_CR63","unstructured":"Vigerske, S.: Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming. Ph.D. thesis, Humboldt-Universit\u00e4t zu Berlin, Mathematisch-Naturwissenschaftliche Fakult\u00e4t II (2013). http:\/\/nbn-resolving.de\/urn:nbn:de:kobv:11-100208240"},{"issue":"3","key":"1691_CR64","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1080\/10556788.2017.1335312","volume":"33","author":"S Vigerske","year":"2017","unstructured":"Vigerske, S., Gleixner, A.: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim. Methods Softw. 33(3), 563\u2013593 (2017). https:\/\/doi.org\/10.1080\/10556788.2017.1335312","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1691_CR65","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/s0969-6016(97)00001-4","volume":"4","author":"P Wentges","year":"1997","unstructured":"Wentges, P.: Weighted Dantzig\u2013Wolfe decomposition for linear mixed-integer programming. Int. Trans. Oper. Res. 4(2), 151\u2013162 (1997). https:\/\/doi.org\/10.1016\/s0969-6016(97)00001-4","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"1691_CR66","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2005). https:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."},{"issue":"11","key":"1691_CR67","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1057\/jors.1991.190","volume":"42","author":"L Xingsi","year":"1991","unstructured":"Xingsi, L.: An aggregate constraint method for non-linear programming. J. Oper. Res. Soc. 42(11), 1003\u20131010 (1991). https:\/\/doi.org\/10.1057\/jors.1991.190","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"1691_CR68","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10898-017-0559-0","volume":"70","author":"K Zhou","year":"2017","unstructured":"Zhou, K., K\u0131l\u0131n\u00e7, M.R., Chen, X., Sahinidis, N.V.: An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver. J. Global Optim. 70(3), 497\u2013516 (2017). https:\/\/doi.org\/10.1007\/s10898-017-0559-0","journal-title":"J. Global Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01691-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01691-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01691-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T17:20:37Z","timestamp":1646846437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01691-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,17]]},"references-count":68,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1691"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01691-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,17]]},"assertion":[{"value":"29 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}