{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:21Z","timestamp":1740122421450,"version":"3.37.3"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T00:00:00Z","timestamp":1726876800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T00:00:00Z","timestamp":1726876800000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10898-024-01433-w","type":"journal-article","created":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T03:32:19Z","timestamp":1726889539000},"page":"129-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving a class of two-stage stochastic nonlinear integer programs using value functions"],"prefix":"10.1007","volume":"91","author":[{"given":"Junlong","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0093-5645","authenticated-orcid":false,"given":"Osman Y.","family":"\u00d6zalt\u0131n","sequence":"additional","affiliation":[]},{"given":"Andrew C.","family":"Trapp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,21]]},"reference":[{"issue":"2","key":"1433_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01585994","volume":"71","author":"C Blair","year":"1995","unstructured":"Blair, C.: A closed-form representation of mixed-integer program value functions. Math. Program. 71(2), 127\u2013136 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"1433_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01583794","volume":"23","author":"CE Blair","year":"1982","unstructured":"Blair, C.E., Jeroslow, R.G.: The value function of an integer program. Math. Program. 23(1), 237\u2013273 (1982)","journal-title":"Math. Program."},{"issue":"3","key":"1433_CR3","first-page":"118","volume":"4","author":"M Guzelsoy","year":"2007","unstructured":"Guzelsoy, M., Ralphs, T.K.: Duality for mixed-integer linear programs. Int. J. Oper. Res. 4(3), 118\u2013137 (2007)","journal-title":"Int. J. Oper. Res."},{"issue":"1","key":"1433_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01589344","volume":"20","author":"LA Wolsey","year":"1981","unstructured":"Wolsey, L.A.: Integer programming duality: price functions and sensitivity analysis. Math. Program. 20(1), 173\u2013195 (1981)","journal-title":"Math. Program."},{"issue":"2","key":"1433_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-003-0475-6","volume":"100","author":"S Ahmed","year":"2004","unstructured":"Ahmed, S., Tawarmalani, M., Sahinidis, N.V.: A finite branch-and-bound algorithm for two-stage stochastic integer programs. Math. Program. 100(2), 355\u2013377 (2004)","journal-title":"Math. Program."},{"key":"1433_CR6","unstructured":"Antley, E.: Integrated value function global optimization approaches for two-stage stochastic programs. PhD thesis, Rice University (2021)"},{"key":"1433_CR7","unstructured":"Hassanzadeh, A., Ralphs, T.K.: A generalization of Benders\u2019 algorithm for two-stage stochastic optimization problems with mixed integer recourse. COR@L Technical Report 14T\u2013005 (2014)"},{"issue":"2","key":"1433_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10107-006-0711-y","volume":"108","author":"N Kong","year":"2006","unstructured":"Kong, N., Schaefer, A.J., Hunsaker, B.: Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach. Math. Program. 108(2), 275\u2013296 (2006)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1433_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10107-010-0412-4","volume":"133","author":"OY \u00d6zalt\u0131n","year":"2012","unstructured":"\u00d6zalt\u0131n, O.Y., Prokopyev, O.A., Schaefer, A.J.: Two-stage quadratic integer programs with stochastic right-hand sides. Math. Program. 133(1\u20132), 121\u2013158 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"1433_CR10","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.1120.1156","volume":"61","author":"AC Trapp","year":"2013","unstructured":"Trapp, A.C., Prokopyev, O.A., Schaefer, A.J.: On a level-set characterization of the value function of an integer program and its application to stochastic programming. Oper. Res. 61(2), 498\u2013511 (2013)","journal-title":"Oper. Res."},{"key":"1433_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.disopt.2014.11.003","volume":"15","author":"AC Trapp","year":"2015","unstructured":"Trapp, A.C., Prokopyev, O.A.: A note on constraint aggregation and value functions for two-stage stochastic integer programs. Discret. Optim. 15, 37\u201345 (2015)","journal-title":"Discret. Optim."},{"issue":"6","key":"1433_CR12","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1080\/24725854.2017.1302116","volume":"49","author":"J Zhang","year":"2017","unstructured":"Zhang, J., \u00d6zalt\u0131n, O.Y.: Single-ratio fractional integer programs with stochastic right-hand sides. IISE Transactions 49(6), 579\u2013592 (2017)","journal-title":"IISE Transactions"},{"issue":"1","key":"1433_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10107-019-01424-w","volume":"185","author":"A Basu","year":"2021","unstructured":"Basu, A., Ryan, C.T., Sankaranarayanan, S.: Mixed-integer bilevel representability. Math. Program. 185(1), 163\u2013197 (2021)","journal-title":"Math. Program."},{"issue":"2","key":"1433_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10898-016-0478-5","volume":"68","author":"S Dempe","year":"2017","unstructured":"Dempe, S., Kue, F.M.: Solving discrete linear bilevel optimization problems using the optimal value reformulation. J. Global Optim. 68(2), 255\u2013277 (2017)","journal-title":"J. Global Optim."},{"issue":"3","key":"1433_CR15","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1287\/opre.2017.1589","volume":"65","author":"L Lozano","year":"2017","unstructured":"Lozano, L., Smith, J.C.: A value-function-based exact approach for the bilevel mixed-integer programming problem. Oper. Res. 65(3), 768\u2013786 (2017)","journal-title":"Oper. Res."},{"issue":"4","key":"1433_CR16","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s12532-020-00183-6","volume":"12","author":"S Tahernejad","year":"2020","unstructured":"Tahernejad, S., Ralphs, T.K., DeNegre, S.T.: A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. Math. Program. Comput. 12(4), 529\u2013568 (2020)","journal-title":"Math. Program. Comput."},{"issue":"6","key":"1433_CR17","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1287\/opre.2019.1842","volume":"67","author":"O Tavasl\u0131o\u011flu","year":"2019","unstructured":"Tavasl\u0131o\u011flu, O., Prokopyev, O.A., Schaefer, A.J.: Solving stochastic and bilevel mixed-integer programs via a generalized value function. Oper. Res. 67(6), 1659\u20131677 (2019)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"1433_CR18","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10479-018-2970-4","volume":"298","author":"GL Zenarosa","year":"2021","unstructured":"Zenarosa, G.L., Prokopyev, O.A., Pasiliao, E.L.: On exact solution approaches for bilevel quadratic 0\u20131 knapsack problem. Ann. Oper. Res. 298(1\u20132), 555\u2013572 (2021)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"1433_CR19","first-page":"1644","volume":"33","author":"J Zhang","year":"2021","unstructured":"Zhang, J., \u00d6zalt\u0131n, O.Y.: Bilevel integer programs with stochastic right-hand sides. INFORMS J. Comput. 33(4), 1644\u20131660 (2021)","journal-title":"INFORMS J. Comput."},{"key":"1433_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105313","volume":"132","author":"A Bansal","year":"2021","unstructured":"Bansal, A., Berg, B.P., Huang, Y.-L.: A value function-based approach for robust surgery planning. Comput. Oper. Res. 132, 105313 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"1\u20132","key":"1433_CR21","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-021-01765-5","volume":"196","author":"M Bodur","year":"2022","unstructured":"Bodur, M., Ahmed, S., Boland, N., Nemhauser, G.L.: Decomposition of loosely coupled integer programs: a multiobjective perspective. Math. Program. 196(1\u20132), 427\u2013477 (2022)","journal-title":"Math. Program."},{"issue":"4","key":"1433_CR22","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/j.orl.2021.04.008","volume":"49","author":"S Brown","year":"2021","unstructured":"Brown, S., Zhang, W., Ajayi, T., Schaefer, A.J.: A Gilmore-Gomory construction of integer programming value functions. Oper. Res. Lett. 49(4), 522\u2013529 (2021)","journal-title":"Oper. Res. Lett."},{"key":"1433_CR23","unstructured":"Ralphs, T.K., Hassanzadeh, A.: On the value function of a mixed integer linear optimization problem and an algorithm for its construction. COR@L Technical Report 14T\u2013004 (2014)"},{"key":"1433_CR24","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"1433_CR25","unstructured":"Gamrath, G., Anderson, D., Bestuzheva, K., Chen, W.-K., Eifler, L., Gasse, M., Gemander, P., Gleixner, A., Gottwald, L., Halbig, K., Hendel, G., Hojny, C., Koch, T., Le\u00a0Bodic, P., Maher, S.J., Matter, F., Miltenberger, M., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Tawfik, C., Vigerske, S., Wegscheider, F., Weninger, D., Witzig, J.: The SCIP Optimization Suite 7.0. ZIB-Report 20-10, Zuse Institute Berlin (March 2020). http:\/\/nbn-resolving.de\/urn:nbn:de:0297-zib-78023"},{"key":"1433_CR26","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual. https:\/\/www.gurobi.com (2022)"},{"issue":"2","key":"1433_CR27","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0012-365X(77)90028-0","volume":"19","author":"CE Blair","year":"1977","unstructured":"Blair, C.E., Jeroslow, R.G.: The value function of a mixed integer program: I. Discret. Math. 19(2), 121\u2013138 (1977)","journal-title":"Discret. Math."},{"issue":"1","key":"1433_CR28","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0012-365X(79)90147-X","volume":"25","author":"CE Blair","year":"1979","unstructured":"Blair, C.E., Jeroslow, R.G.: The value function of a mixed integer program: II. Discret. Math. 25(1), 7\u201319 (1979)","journal-title":"Discret. Math."},{"key":"1433_CR29","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF02680560","volume":"83","author":"R Schultz","year":"1998","unstructured":"Schultz, R., Stougie, L., Van Der Vlerk, M.H.: Solving stochastic programs with integer recourse by enumeration: a framework using Gr\u00f6bner basis. Math. Program. 83, 229\u2013252 (1998)","journal-title":"Math. Program."},{"issue":"2","key":"1433_CR30","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1287\/opre.2020.2003","volume":"70","author":"T Ajayi","year":"2022","unstructured":"Ajayi, T., Thomas, C., Schaefer, A.J.: The gap function: evaluating integer programming models over multiple right-hand sides. Oper. Res. 70(2), 1259\u20131270 (2022)","journal-title":"Oper. Res."},{"key":"1433_CR31","unstructured":"Fallah, S., Ralphs, T.K., Boland, N.L., Snyder, L.V.: On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem. COR@L Technical Report 22T-005-R1 (2022)"},{"issue":"1","key":"1433_CR32","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s10479-015-1899-0","volume":"235","author":"E Mijangos","year":"2015","unstructured":"Mijangos, E.: An algorithm for two-stage stochastic mixed-integer nonlinear convex problems. Ann. Oper. Res. 235(1), 581\u2013598 (2015)","journal-title":"Ann. Oper. Res."},{"key":"1433_CR33","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.compchemeng.2018.01.017","volume":"112","author":"C Li","year":"2018","unstructured":"Li, C., Grossmann, I.E.: An improved L-shaped method for two-stage convex 0\u20131 mixed integer nonlinear stochastic programs. Comput. Chem. Eng 112, 165\u2013179 (2018)","journal-title":"Comput. Chem. Eng"},{"issue":"4","key":"1433_CR34","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/s10898-019-00820-y","volume":"75","author":"C Li","year":"2019","unstructured":"Li, C., Grossmann, I.E.: A finite $$\\epsilon $$-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables. J. Global Optim. 75(4), 921\u2013947 (2019)","journal-title":"J. Global Optim."},{"issue":"3\u20134","key":"1433_CR35","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10287-018-0311-3","volume":"15","author":"S Atakan","year":"2018","unstructured":"Atakan, S., Sen, S.: A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs. CMS 15(3\u20134), 501\u2013540 (2018)","journal-title":"CMS"},{"key":"1433_CR36","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10957-011-9888-1","volume":"151","author":"X Li","year":"2011","unstructured":"Li, X., Tomasgard, A., Barton, P.I.: Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs. J. Optim. Theory Appl. 151, 425\u2013454 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"1433_CR37","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10898-019-00786-x","volume":"75","author":"E Ogbe","year":"2019","unstructured":"Ogbe, E., Li, X.: A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs. J. Global Optim. 75, 595\u2013629 (2019)","journal-title":"J. Global Optim."},{"key":"1433_CR38","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10898-019-00769-y","volume":"75","author":"Y Cao","year":"2019","unstructured":"Cao, Y., Zavala, V.M.: A scalable global optimization algorithm for stochastic nonlinear programs. J. Global Optim. 75, 393\u2013416 (2019)","journal-title":"J. Global Optim."},{"key":"1433_CR39","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10898-019-00816-8","volume":"75","author":"C Li","year":"2019","unstructured":"Li, C., Grossmann, I.E.: A generalized benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables. J. Global Optim. 75, 247\u2013272 (2019)","journal-title":"J. Global Optim."},{"key":"1433_CR40","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1007\/s11081-020-09563-2","volume":"22","author":"C Li","year":"2021","unstructured":"Li, C., Bernal, D.E., Furman, K.C., Duran, M.A., Grossmann, I.E.: Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation. Optim. Eng. 22, 1245\u20131273 (2021)","journal-title":"Optim. Eng."},{"key":"1433_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (2011)"},{"issue":"3","key":"1433_CR42","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1287\/ijoc.2016.0703","volume":"28","author":"A Ghoniem","year":"2016","unstructured":"Ghoniem, A., Flamand, T., Haouari, M.: Optimization-based very large-scale neighborhood search for generalized assignment problems with location\/allocation considerations. INFORMS J. Comput. 28(3), 575\u2013588 (2016)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"1433_CR43","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1287\/ijoc.15.3.249.16075","volume":"15","author":"RM Nauss","year":"2003","unstructured":"Nauss, R.M.: Solving the generalized assignment problem: an optimizing and heuristic approach. INFORMS J. Comput. 15(3), 249\u2013266 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"1433_CR44","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M Savelsbergh","year":"1997","unstructured":"Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6), 831\u2013841 (1997)","journal-title":"Oper. Res."},{"issue":"8","key":"1433_CR45","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1287\/mnsc.35.8.923","volume":"35","author":"JB Mazzola","year":"1989","unstructured":"Mazzola, J.B.: Generalized assignment with nonlinear capacity interaction. Manage. Sci. 35(8), 923\u2013941 (1989)","journal-title":"Manage. Sci."},{"issue":"3","key":"1433_CR46","first-page":"123","volume":"45","author":"T \u00d6ncan","year":"2007","unstructured":"\u00d6ncan, T.: A survey of the generalized assignment problem and its applications. INFOR Inf. Syst. Oper. Res. 45(3), 123\u2013141 (2007)","journal-title":"INFOR Inf. Syst. Oper. Res."},{"issue":"3","key":"1433_CR47","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/j.cor.2004.07.015","volume":"33","author":"B Toktas","year":"2006","unstructured":"Toktas, B., Yen, J.W., Zabinsky, Z.B.: Addressing capacity uncertainty in resource-constrained assignment problems. Comput. Oper. Res. 33(3), 724\u2013745 (2006)","journal-title":"Comput. Oper. Res."},{"key":"1433_CR48","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: The quadratic knapsack problem. In: Knapsack Problems, pp. 349\u2013388. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-24777-7_12"},{"issue":"2","key":"1433_CR49","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43(2), 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"issue":"2","key":"1433_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1095-2","volume":"165","author":"C Chen","year":"2017","unstructured":"Chen, C., Atamt\u00fcrk, A., Oren, S.S.: A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables. Math. Program. 165(2), 1\u201329 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"1433_CR51","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-014-0195-x","volume":"61","author":"Z Deng","year":"2015","unstructured":"Deng, Z., Fang, S.-C., Jin, Q., Lu, C.: Conic approximation to nonconvex quadratic programming with convex quadratic constraints. J. Global Optim. 61(3), 459\u2013478 (2015)","journal-title":"J. Global Optim."},{"issue":"1","key":"1433_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/050642691","volume":"18","author":"Z-Q Luo","year":"2007","unstructured":"Luo, Z.-Q., Sidiropoulos, N.D., Tseng, P., Zhang, S.: Approximation bounds for quadratic optimization with homogeneous quadratic constraints. SIAM J. Optim. 18(1), 1\u201328 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1433_CR53","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/110836183","volume":"23","author":"A Gupte","year":"2013","unstructured":"Gupte, A., Ahmed, S., Cheon, M.S., Dey, S.: Solving mixed integer bilinear problems using MILP formulations. SIAM J. Optim. 23(2), 721\u2013744 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1433_CR54","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10107-007-0184-7","volume":"118","author":"A Caprara","year":"2009","unstructured":"Caprara, A., Monaci, M.: Bidimensional packing by bilinear programming. Math. Program. 118(1), 75\u2013108 (2009)","journal-title":"Math. Program."},{"issue":"4","key":"1433_CR55","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.compchemeng.2005.11.005","volume":"30","author":"R Karuppiah","year":"2006","unstructured":"Karuppiah, R., Grossmann, I.E.: Global optimization for the synthesis of integrated water systems in chemical processes. Comput. Chem. Eng. 30(4), 650\u2013673 (2006)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"1433_CR56","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1002\/aic.10717","volume":"52","author":"CA Meyer","year":"2006","unstructured":"Meyer, C.A., Floudas, C.A.: Global optimization of a combinatorially complex generalized pooling problem. AIChE J. 52(3), 1027\u20131037 (2006)","journal-title":"AIChE J."},{"issue":"12","key":"1433_CR57","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/0098-1354(94)00123-5","volume":"19","author":"I Quesada","year":"1995","unstructured":"Quesada, I., Grossmann, I.E.: Global optimization of bilinear process networks with multicomponent flows. Comput. Chem. Eng. 19(12), 1219\u20131242 (1995)","journal-title":"Comput. Chem. Eng."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01433-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01433-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01433-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T09:03:06Z","timestamp":1736586186000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01433-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,21]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1433"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01433-w","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2024,9,21]]},"assertion":[{"value":"24 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2024","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 have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}