{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:00Z","timestamp":1740145140304,"version":"3.37.3"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11590-023-01987-w","type":"journal-article","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T02:02:48Z","timestamp":1677722568000},"page":"851-866","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7482-1229","authenticated-orcid":false,"given":"Pitchaya","family":"Wiratchotisatian","sequence":"first","affiliation":[]},{"given":"Andrew C.","family":"Trapp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,2]]},"reference":[{"issue":"6","key":"1987_CR1","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1287\/opre.1120.1106","volume":"60","author":"WP Adams","year":"2012","unstructured":"Adams, W.P., Henry, S.M.: Base-2 expansions for linearizing products of functions of discrete variables. Oper. Res. 60(6), 1477\u20131490 (2012)","journal-title":"Oper. Res."},{"issue":"9","key":"1987_CR2","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/S0098-1354(98)00218-X","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: A global optimization method, $$\\alpha$$BB, for general twice-differentiable constrained NLPs\u2014II. implementation and computational results. Comput. Chem. Eng. 22(9), 1159\u20131179 (1998)","journal-title":"Comput. Chem. Eng."},{"issue":"9","key":"1987_CR3","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Dallwig, S., Floudas, C.A., Neumaier, A.: A global optimization method, $$\\alpha$$BB, for general twice-differentiable constrained NLPs\u2014I. theoretical advances. Comput. Chem. Eng. 22(9), 1137\u20131158 (1998)","journal-title":"Comput. Chem. Eng."},{"issue":"9","key":"1987_CR4","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1002\/aic.690460908","volume":"46","author":"CS Adjiman","year":"2000","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: Global optimization of mixed-integer nonlinear problems. AIChE J. 46(9), 1769\u20131797 (2000)","journal-title":"AIChE J."},{"issue":"4","key":"1987_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01099647","volume":"7","author":"IP Androulakis","year":"1995","unstructured":"Androulakis, I.P., Maranas, C.D., Floudas, C.A.: $$\\alpha$$BB: A global optimization method for general constrained nonconvex problems. J. Glob. Opt. 7(4), 337\u2013363 (1995)","journal-title":"J. Glob. Opt."},{"issue":"21","key":"1987_CR6","first-page":"5136","volume":"258","author":"E Balas","year":"1964","unstructured":"Balas, E.: Extension de l\u2019algorithme additif a la programmation en nombres entiers et a la programmation non lineaire. C.R. Acad. Sci. Paris 258(21), 5136 (1964)","journal-title":"C.R. Acad. Sci. Paris"},{"key":"1987_CR7","doi-asserted-by":"crossref","unstructured":"Beale, E.: Branch and bound methods for mathematical programming systems. In: Ann. Discrete Math. 5, 201\u2013219. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70351-0"},{"issue":"1","key":"1987_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF01580653","volume":"10","author":"E Beale","year":"1976","unstructured":"Beale, E., Forrest, J.J.: Global optimization using special ordered sets. Math. Program. 10(1), 52\u201369 (1976)","journal-title":"Math. Program."},{"issue":"447\u2013454","key":"1987_CR9","first-page":"99","volume":"69","author":"E Beale","year":"1970","unstructured":"Beale, E., Tomlin, J.: Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables. OR 69(447\u2013454), 99 (1970)","journal-title":"OR"},{"issue":"4\u20135","key":"1987_CR10","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Opt. Methods Softw. 24(4\u20135), 597\u2013634 (2009)","journal-title":"Opt. Methods Softw."},{"issue":"1","key":"1987_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/nav.3800320119","volume":"32","author":"HP Benson","year":"1985","unstructured":"Benson, H.P.: A finite algorithm for concave minimization over a polyhedron. Naval Res. Logistics Q. 32(1), 165\u2013177 (1985)","journal-title":"Naval Res. Logistics Q."},{"key":"1987_CR12","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens. The Ann. Stat. 44(2), 813\u2013852 (2016). http:\/\/www.jstor.org\/stable\/43818629","DOI":"10.1214\/15-AOS1388"},{"issue":"4","key":"1987_CR13","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1287\/opre.43.4.670","volume":"43","author":"KM Bretthauer","year":"1995","unstructured":"Bretthauer, K.M., Shetty, B.: The nonlinear resource allocation problem. Oper. Res. 43(4), 670\u2013683 (1995)","journal-title":"Oper. Res."},{"issue":"3","key":"1987_CR14","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S0377-2217(01)00179-5","volume":"138","author":"KM Bretthauer","year":"2002","unstructured":"Bretthauer, K.M., Shetty, B.: The nonlinear knapsack problem-algorithms and applications. Eur. J. Oper. Res. 138(3), 459\u2013472 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"1987_CR15","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/S0305-0548(00)00089-7","volume":"29","author":"KM Bretthauer","year":"2002","unstructured":"Bretthauer, K.M., Shetty, B.: A pegging algorithm for the nonlinear resource allocation problem. Comput. Oper. Res. 29(5), 505\u2013527 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1987_CR16","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1002\/1520-6750(199404)41:3<435::AID-NAV3220410309>3.0.CO;2-6","volume":"41","author":"KM Bretthauer","year":"1994","unstructured":"Bretthauer, K.M., Victor Cabot, A., Venkataramanan, M.: An algorithm and new penalties for concave integer minimization over a polyhedron. Naval Res. Logistics (NRL) 41(3), 435\u2013454 (1994)","journal-title":"Naval Res. Logistics (NRL)"},{"issue":"2","key":"1987_CR17","first-page":"97","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: A survey. Surveys Oper. Res. Manage. Sci. 17(2), 97\u2013106 (2012)","journal-title":"Surveys Oper. Res. Manage. Sci."},{"issue":"3","key":"1987_CR18","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/99.714603","volume":"5","author":"J Czyzyk","year":"1998","unstructured":"Czyzyk, J., Mesnier, M.P., Mor\u00e9, J.J.: The NEOS server. IEEE J. Comput. Sci. Eng. 5(3), 68\u201375 (1998)","journal-title":"IEEE J. Comput. Sci. Eng."},{"key":"1987_CR19","doi-asserted-by":"crossref","unstructured":"D\u2019Ambrosio, C., Lee, J., W\u00e4chter, A.: An algorithmic framework for MINLP with separable non-convexity. In: Mixed Integer Nonlinear Programming, pp. 315\u2013347. Springer (2012)","DOI":"10.1007\/978-1-4614-1927-3_11"},{"key":"1987_CR20","doi-asserted-by":"crossref","unstructured":"Dolan, E.D.: The NEOS server 4.0 administrative guide. Technical Memorandum ANL\/MCS-TM-250, Mathematics and Computer Science Division, Argonne National Laboratory (2001)","DOI":"10.2172\/822567"},{"key":"1987_CR21","doi-asserted-by":"crossref","unstructured":"Floudas, C.A., Visweswaran, V.: Quadratic optimization. In: Handbook of Global Optimization, pp. 217\u2013269. Springer, Berlin (1995)","DOI":"10.1007\/978-1-4615-2025-2_5"},{"key":"1987_CR22","volume-title":"Deterministic Global Optimization: Theory, Methods and Applications","author":"CA Floudas","year":"2013","unstructured":"Floudas, C.A.: Deterministic Global Optimization: Theory, Methods and Applications, vol. 37. Springer Science & Business Media, Berlin (2013)"},{"issue":"1","key":"1987_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10898-008-9332-8","volume":"45","author":"CA Floudas","year":"2009","unstructured":"Floudas, C.A., Gounaris, C.E.: A review of recent advances in global optimization. J. Glob. Opt. 45(1), 3 (2009)","journal-title":"J. Glob. Opt."},{"issue":"7","key":"1987_CR24","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1287\/mnsc.30.7.890","volume":"30","author":"GE Fox","year":"1984","unstructured":"Fox, G.E., Baker, N.R., Bryant, J.L.: Economic models for r and d project selection in the presence of project interactions. Manage. Sci. 30(7), 890\u2013902 (1984)","journal-title":"Manage. Sci."},{"key":"1987_CR25","doi-asserted-by":"crossref","unstructured":"Gallo, G., Hammer, P.L., Simeone, B.: Quadratic knapsack problems. In: Comb. Opt., pp. 132\u2013149. Springer (1980)","DOI":"10.1007\/BFb0120892"},{"key":"1987_CR26","doi-asserted-by":"crossref","unstructured":"Gei\u00dfler, B., Martin, A., Morsi, A., Schewe, L.: Using piecewise linear functions for solving MINLPs. In: Mixed Integer Nonlinear Programming, pp. 287\u2013314. Springer (2012)","DOI":"10.1007\/978-1-4614-1927-3_10"},{"key":"1987_CR27","unstructured":"Gropp, W., Mor\u00e9, J.J.: Optimization environments and the NEOS server. In: M.D. Buhman, A.\u00a0Iserles (eds.) Approximation Theory and Optimization, pp. 167\u2013182. Cambridge University Press, Cambridge (1997)"},{"key":"1987_CR28","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual. Version 9.1 (2020). http:\/\/www.gurobi.com"},{"issue":"2","key":"1987_CR29","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1086\/295264","volume":"43","author":"G Hanoch","year":"1970","unstructured":"Hanoch, G., Levy, H.: Efficient portfolio selection with quadratic and cubic utility. J. Bus. 43(2), 181\u2013189 (1970)","journal-title":"J. Bus."},{"issue":"2","key":"1987_CR30","first-page":"61","volume":"3","author":"C Henin","year":"1980","unstructured":"Henin, C., Doutriaux, J.: A specialization of the convex simplex method to cubic programming. Rivista di matematica per le scienze economiche e sociali 3(2), 61\u201372 (1980)","journal-title":"Rivista di matematica per le scienze economiche e sociali"},{"key":"1987_CR31","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"2013","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer Science & Business Media, Heidelberg (2013)"},{"issue":"2","key":"1987_CR32","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10898-007-9203-8","volume":"41","author":"R Karuppiah","year":"2008","unstructured":"Karuppiah, R., Grossmann, I.E.: A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures. J. Glob. Opt. 41(2), 163\u2013186 (2008)","journal-title":"J. Glob. Opt."},{"issue":"1","key":"1987_CR33","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/S0167-6377(03)00059-2","volume":"32","author":"AB Keha","year":"2004","unstructured":"Keha, A.B., de Farias Jr, I.R., Nemhauser, G.L.: Models for representing piecewise linear cost functions. Oper. Res. Lett. 32(1), 44\u201348 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"1987_CR34","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1287\/opre.1060.0277","volume":"54","author":"AB Keha","year":"2006","unstructured":"Keha, A.B., de Farias Jr, I.R., Nemhauser, G.L.: A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization. Oper. Res. 54(5), 847\u2013858 (2006)","journal-title":"Oper. Res."},{"issue":"3","key":"1987_CR35","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10107-004-0503-1","volume":"100","author":"P Kesavan","year":"2004","unstructured":"Kesavan, P., Allgor, R.J., Gatzke, E.P., Barton, P.I.: Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs. Math. Program. 100(3), 517\u2013535 (2004)","journal-title":"Math. Program."},{"issue":"203","key":"1987_CR36","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1090\/S0025-5718-1993-1197512-7","volume":"61","author":"DE Knuth","year":"1993","unstructured":"Knuth, D.E.: Johann Faulhaber and sums of powers. Math. Comput. 61(203), 277\u2013294 (1993)","journal-title":"Math. Comput."},{"key":"1987_CR37","doi-asserted-by":"crossref","unstructured":"Land, A.H., Doig, A.G.: An automatic method for solving discrete programming problems. In: 50 Years of Integer Programming 1958\u20132008, pp. 105\u2013132. Springer (2010)","DOI":"10.1007\/978-3-540-68279-0_5"},{"issue":"11\u201312","key":"1987_CR38","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1016\/S0098-1354(01)00732-3","volume":"25","author":"S Lee","year":"2001","unstructured":"Lee, S., Grossmann, I.E.: A global optimization algorithm for nonconvex generalized disjunctive programming and applications to process systems. Comput. Chem. Eng. 25(11\u201312), 1675\u20131697 (2001)","journal-title":"Comput. Chem. Eng."},{"key":"1987_CR39","unstructured":"Leyffer, S., Sartenaer, A., Wanufelle, E.: Branch-and-refine for mixed-integer nonconvex global optimization. Preprint ANL\/MCS-P1547-0908. Mathematics and Computer Science Division, Argonne National Laboratory 39, 40\u201378 (2008)"},{"issue":"3","key":"1987_CR40","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1287\/opre.1080.0586","volume":"57","author":"HL Li","year":"2009","unstructured":"Li, H.L., Lu, H.C.: Global optimization for generalized geometric programs with mixed free-sign variables. Oper. Res. 57(3), 701\u2013713 (2009)","journal-title":"Oper. Res."},{"key":"1987_CR41","volume-title":"Nonlinear Integer Programming","author":"D Li","year":"2006","unstructured":"Li, D., Sun, X.: Nonlinear Integer Programming, vol. 84. Springer Science & Business Media, Berlin (2006)"},{"issue":"2","key":"1987_CR42","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/ijoc.1080.0294","volume":"21","author":"HL Li","year":"2009","unstructured":"Li, H.L., Lu, H.C., Huang, C.H., Hu, N.Z.: A superior representation method for piecewise linear functions. INFORMS J. Comput. 21(2), 314\u2013321 (2009)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"1987_CR43","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/ijoc.1120.0527","volume":"25","author":"HL Li","year":"2013","unstructured":"Li, H.L., Huang, Y.H., Fang, S.C.: A logarithmic method for reducing binary variables and inequality constraints in solving task assignment problems. INFORMS J. Comput. 25(4), 643\u2013653 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"1987_CR44","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1287\/ijoc.2016.0716","volume":"29","author":"HL Li","year":"2017","unstructured":"Li, H.L., Huang, Y.H., Fang, S.C.: Linear reformulation of polynomial discrete programming for fast computation. INFORMS J. Comput. 29(1), 108\u2013122 (2017). https:\/\/doi.org\/10.1287\/ijoc.2016.0716","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"1987_CR45","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1287\/opre.23.2.360","volume":"23","author":"H Luss","year":"1975","unstructured":"Luss, H., Gupta, S.K.: Allocation of effort resources among competing activities. Oper. Res. 23(2), 360\u2013366 (1975)","journal-title":"Oper. Res."},{"issue":"4","key":"1987_CR46","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1287\/inte.2015.0796","volume":"45","author":"KL Maass","year":"2015","unstructured":"Maass, K.L., Lo, V.M.H., Weiss, A., Daskin, M.S.: Maximizing diversity in the engineering global leadership cultural families. Interfaces 45(4), 293\u2013304 (2015)","journal-title":"Interfaces"},{"issue":"6","key":"1987_CR47","doi-asserted-by":"publisher","first-page":"549","DOI":"10.4169\/amer.math.monthly.118.06.549","volume":"118","author":"K MacMillan","year":"2011","unstructured":"MacMillan, K., Sondow, J.: Proofs of power sum and binomial coefficient congruences via Pascal\u2019s identity. Am. Math. Monthly 118(6), 549\u2013551 (2011)","journal-title":"Am. Math. Monthly"},{"issue":"1","key":"1987_CR48","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01588949","volume":"14","author":"RE Marsten","year":"1978","unstructured":"Marsten, R.E., Morin, T.L.: A hybrid approach to discrete mathematical programming. Math. Program. 14(1), 21\u201340 (1978)","journal-title":"Math. Program."},{"issue":"1","key":"1987_CR49","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-convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"1987_CR50","unstructured":"MINLPLib (2021): Mixed-integer nonlinear programming library (2021). http:\/\/www.minlplib.org\/. Last accessed on 2023\/02\/03 08:36:05"},{"issue":"2","key":"1987_CR51","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/opre.41.2.319","volume":"41","author":"SS Nielsen","year":"1993","unstructured":"Nielsen, S.S., Zenios, S.A.: A massively parallel algorithm for nonlinear stochastic network problems. Oper. Res. 41(2), 319\u2013337 (1993)","journal-title":"Oper. Res."},{"issue":"22","key":"1987_CR52","doi-asserted-by":"publisher","first-page":"1938","DOI":"10.1080\/01457632.2019.1675251","volume":"41","author":"P Regucki","year":"2020","unstructured":"Regucki, P., Lewkowicz, M., Krzy\u017cy\u0144ska, R.: Optimization of thermal-flow processes in a system of conjugate cooling towers. Heat Transf. Eng. 41(22), 1938\u20131948 (2020)","journal-title":"Heat Transf. Eng."},{"issue":"5","key":"1987_CR53","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"HS Ryoo","year":"1995","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551\u2013566 (1995)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"1987_CR54","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"HS Ryoo","year":"1996","unstructured":"Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Glob. Opt. 8(2), 107\u2013138 (1996)","journal-title":"J. Glob. Opt."},{"key":"1987_CR55","unstructured":"Sahinidis, N.V.: BARON 21.1.13: Global Optimization of Mixed-Integer Nonlinear Programs. User\u2019s Manual (2017)"},{"issue":"9","key":"1987_CR56","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1057\/jors.1990.121","volume":"41","author":"B Shetty","year":"1990","unstructured":"Shetty, B., Muthukrishnan, R.: A parallel projection for the multicommodity network model. J. Oper. Res. Soc. 41(9), 837\u2013842 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"1987_CR57","doi-asserted-by":"publisher","first-page":"406","DOI":"10.2197\/ipsjjip.28.406","volume":"28","author":"N Shimada","year":"2020","unstructured":"Shimada, N., Yamazaki, N., Takano, Y.: Multi-objective optimization models for many-to-one matching problems. J. Inf. Process. 28, 406\u2013412 (2020). https:\/\/doi.org\/10.2197\/ipsjjip.28.406","journal-title":"J. Inf. Process."},{"key":"1987_CR58","doi-asserted-by":"publisher","first-page":"S791","DOI":"10.1016\/S0098-1354(97)00146-4","volume":"21","author":"EM Smith","year":"1997","unstructured":"Smith, E.M., Pantelides, C.C.: Global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 21, S791\u2013S796 (1997)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"1987_CR59","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Math. Program. 99(3), 563\u2013591 (2004)","journal-title":"Math. Program."},{"issue":"2","key":"1987_CR60","doi-asserted-by":"publisher","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(2), 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"1987_CR61","first-page":"1437","volume":"5","author":"H Tuy","year":"1964","unstructured":"Tuy, H.: Concave programming under linear constraints. Soviet Math. 5, 1437\u20131440 (1964)","journal-title":"Soviet Math."},{"issue":"1","key":"1987_CR62","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","volume":"128","author":"JP Vielma","year":"2011","unstructured":"Vielma, J.P., Nemhauser, G.L.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128(1), 49\u201372 (2011)","journal-title":"Math. Program."},{"issue":"2","key":"1987_CR63","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/opre.1090.0721","volume":"58","author":"JP Vielma","year":"2010","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.: Mixed-integer models for nonseparable piecewise-linear optimization: Unifying framework and extensions. Oper. Res. 58(2), 303\u2013315 (2010)","journal-title":"Oper. Res."},{"issue":"7","key":"1987_CR64","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1287\/mnsc.12.7.485","volume":"12","author":"HM Weingartner","year":"1966","unstructured":"Weingartner, H.M.: Capital budgeting of interrelated projects: survey and synthesis. Manage. Sci. 12(7), 485\u2013516 (1966)","journal-title":"Manage. Sci."},{"key":"1987_CR65","unstructured":"Weisstein, E.W.: Bernoulli number. https:\/\/mathworld.wolfram.com\/ (2002)"},{"issue":"6","key":"1987_CR66","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.orl.2013.09.004","volume":"41","author":"S Y\u0131ld\u0131z","year":"2013","unstructured":"Y\u0131ld\u0131z, S., Vielma, J.P.: Incremental and encoding formulations for mixed integer programming. Oper. Res. Lett. 41(6), 654\u2013658 (2013)","journal-title":"Oper. Res. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01987-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-01987-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01987-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T13:20:25Z","timestamp":1681305625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-01987-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,2]]},"references-count":66,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1987"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-01987-w","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2023,3,2]]},"assertion":[{"value":"2 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}