{"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":1740122421839,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T00:00:00Z","timestamp":1506470400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"publisher","award":["81801"],"award-info":[{"award-number":["81801"]}],"id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10898-017-0570-5","type":"journal-article","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T08:25:05Z","timestamp":1506500705000},"page":"601-623","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A trajectory-based method for mixed integer nonlinear programming problems"],"prefix":"10.1007","volume":"70","author":[{"given":"Terry-Leigh","family":"Oliphant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Montaz","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"570_CR1","volume-title":"Optimization Methods in Finance","author":"G Cornuejols","year":"2007","unstructured":"Cornuejols, G., Tutuncu, R.: Optimization Methods in Finance. Cambridge University Press, Cambridge (2007)"},{"key":"570_CR2","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1061\/(ASCE)WR.1943-5452.0000229","volume":"138","author":"M Housh","year":"2012","unstructured":"Housh, M., Ostfels, A., Shamir, U.: Box-constrained optimization methodology and its application for a water supply system model. J. Water Resour. Plan. Manag. 138, 651\u2013659 (2012)","journal-title":"J. Water Resour. Plan. Manag."},{"key":"570_CR3","doi-asserted-by":"crossref","unstructured":"Bartholomew Biggs, M.: Nonlinear optimization and engineering applications. Springer optimization and its applications (2008)","DOI":"10.1007\/978-0-387-78723-7"},{"key":"570_CR4","unstructured":"Ryberg, A., Backryd, R.D., Nilsson, L.: Metamodel-based multidisciplinary design optimization for automotive applications. Technical Report, Division of solid mechanics, Linkoping University (Institute of technology), Linkoping (2012)"},{"issue":"3","key":"570_CR5","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"RJ Dakin","year":"1965","unstructured":"Dakin, R.J.: A tree-search algorithm for mixed integer programming problems. Comput. J. 8(3), 250\u2013255 (1965)","journal-title":"Comput. J."},{"issue":"5","key":"570_CR6","doi-asserted-by":"crossref","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 non-convex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551\u2013566 (1995)","journal-title":"Comput. Chem. Eng."},{"key":"570_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1023\/A:1011241421041","volume":"18","author":"S Leyffer","year":"2001","unstructured":"Leyffer, S.: Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Comput. Optim. Appl. 18, 295\u2013309 (2001)","journal-title":"Comput. Optim. Appl."},{"issue":"9","key":"570_CR8","doi-asserted-by":"crossref","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."},{"key":"570_CR9","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossman, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307\u2013339 (1986)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"570_CR10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R Fletcher","year":"1994","unstructured":"Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Math. Program. 66(1\u20133), 327\u2013349 (1994)","journal-title":"Math. Program."},{"key":"570_CR11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund, T., Pettersson, F.: An extended cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 19, 131\u2013136 (1995)","journal-title":"Comput. Chem. Eng."},{"issue":"12","key":"570_CR12","doi-asserted-by":"crossref","first-page":"2655","DOI":"10.1016\/S0098-1354(00)00622-0","volume":"24","author":"R P\u00f6rn","year":"2000","unstructured":"P\u00f6rn, R., Westerlund, T.: A cutting plane method for minimizing pseudo-convex functions in the mixed integer case. Comput. Chem. Eng. 24(12), 2655\u20132665 (2000)","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"570_CR13","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1287\/ijoc.1090.0373","volume":"22","author":"K Abhisek","year":"2010","unstructured":"Abhisek, K., Leyffer, S., Linderoth, J.: An outer approximation-based solver for convex mixed-integer nonlinear programs. INFORMS J. Comput. 22(4), 555\u2013567 (2010)","journal-title":"INFORMS J. Comput."},{"key":"570_CR14","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1016\/j.cor.2010.12.008","volume":"38","author":"J Naoum-Saqaya","year":"2011","unstructured":"Naoum-Saqaya, J., Elhedhlic, S.: An interior point cutting plane heuristic method for mixed integer programming. Comput. Oper. Res. 38, 1335\u20131341 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"570_CR15","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s11590-011-0417-9","volume":"7","author":"S Lucidi","year":"2013","unstructured":"Lucidi, S., Rinaldi, F.: An exact penalty global optimization approach for mixed integer programming problems. Optim. Lett. 7(2), 375\u2013405 (2013)","journal-title":"Optim. Lett."},{"key":"570_CR16","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10957-013-0340-6","volume":"160","author":"E Newby","year":"2014","unstructured":"Newby, E., Ali, M.M.: A note on convex reformulation schemes for mixed integer quadratic programs. J. Optim. Theory Appl. 160, 457\u2013469 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"570_CR17","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1007\/s10957-015-0806-9","volume":"168","author":"E Newby","year":"2016","unstructured":"Newby, E., Ali, A.A.: Transformation-based preprocessing for mixed-integer quadratic programs. J. Optim. Theory Appl. 168, 1039\u20131045 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"570_CR18","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1007\/s11590-015-0988-y","volume":"11","author":"E Newby","year":"2017","unstructured":"Newby, E., Ali, M,M.: Linear transformation based solution methods for non-convex mixed integer quadratic programs. Optim. Lett. 11(5), 967\u2013981 (2017)","journal-title":"Optim. Lett."},{"key":"570_CR19","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0307-904X(82)80007-3","volume":"6","author":"JA Snyman","year":"1982","unstructured":"Snyman, J.A.: A new dynamic method for unconstrained minimization. Appl. Math. Modelling 6, 449\u2013462 (1982)","journal-title":"Appl. Math. Modelling"},{"key":"570_CR20","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0307-904X(83)90011-2","volume":"7","author":"JA Snyman","year":"1983","unstructured":"Snyman, J.A.: An improved version of the original leap-frog dynamic method for unconstrained minimization LFOP1(b). Appl. Math. Modelling 7, 216\u2013218 (1983)","journal-title":"Appl. Math. Modelling"},{"issue":"1","key":"570_CR21","first-page":"1","volume":"60","author":"E Newby","year":"2014","unstructured":"Newby, E., Ali, M.M.: A trust-region-based derivative free algorithm for mixed integer programming. Comput. Optim. Appl. 60(1), 1\u201331 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"570_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"570_CR23","unstructured":"Oliphant, T.N.B.: Trajectory-based methods for solving nonlinear and mixed integer nonlinear programming problems. Ph.D. dissertation, University of the Witwatersrand (2015)"},{"issue":"4","key":"570_CR24","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1093\/imanum\/6.4.433","volume":"6","author":"JC Butcher","year":"1986","unstructured":"Butcher, J.C.: Optimal order and step size sequences. IMA J. Numer. Anal. 6(4), 433\u2013438 (1986)","journal-title":"IMA J. Numer. Anal."},{"key":"570_CR25","unstructured":"Birgin, E.G., Fernandez, D., Martinez, J.M.: On the boundedness of penalty parameters in an augmented Lagrangian method with lower level constraints. Technical Report, Department of Applied Mathematics, State University of Campinas, Brazil"},{"key":"570_CR26","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1007\/s10589-011-9396-0","volume":"51","author":"EG Birgin","year":"2012","unstructured":"Birgin, E.G., Martinez, J.M.: Augmented Lagrangian method with non-monotone penalty parameters for constrained optimization. Comput. Optim. Appl. 51, 941\u2013965 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"570_CR27","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"TG Kolda","year":"2003","unstructured":"Kolda, T.G., Lewis, R.M., Torczon, V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45(3), 385\u2013482 (2003)","journal-title":"SIAM Rev."},{"key":"570_CR28","doi-asserted-by":"crossref","unstructured":"Ali, M.M., Oliphant, T.N.B.: A trajectory-based method for constrained nonlinear optimization problems, under revision (2017)","DOI":"10.1007\/s10898-017-0570-5"},{"issue":"3","key":"570_CR29","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/S0098-1354(98)00305-6","volume":"23","author":"R P\u00f6rn","year":"1999","unstructured":"P\u00f6rn, R., Harjunkoski, I., Westerlund, T.: Convexification of different classes of non-convex MINLP problems. Comput. Chem. Eng. 23(3), 439\u2013448 (1999)","journal-title":"Comput. Chem. Eng."},{"issue":"8","key":"570_CR30","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1021\/ie00080a013","volume":"27","author":"GR Kocis","year":"1998","unstructured":"Kocis, G.R., Grossmann, I.E.: Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis. Ind. Eng. Chem. Res. 27(8), 1407\u20131421 (1998)","journal-title":"Ind. Eng. Chem. Res."},{"key":"570_CR31","unstructured":"Harjunkoski, I.: Application of MINLP methods to a scheduling problem in the paper-converting industry. Ph.D. dissertation, Process Design Laboratory, Department of Chemical Engineering, Abo Akademi University (1997)"},{"key":"570_CR32","unstructured":"Emet, S.: A comparative study of solving some non-convex MINLP problems. Ph.D. dissertation, Abo Akademi University (2004)"},{"key":"570_CR33","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1021091110342","volume":"3","author":"T Westerlund","year":"2002","unstructured":"Westerlund, T., P\u00f6rn, R.: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optim. Eng. 3, 253\u2013280 (2002)","journal-title":"Optim. Eng."},{"key":"570_CR34","doi-asserted-by":"crossref","unstructured":"P\u00f6rn, R.: Mixed integer non-linear programming: convexification techniques and algorithm development. Ph.D. dissertation, Abo Akademi University (2000)","DOI":"10.1016\/S1570-7946(00)80002-4"},{"key":"570_CR35","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195100563.001.0001","volume-title":"Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications","author":"CA Floudas","year":"1995","unstructured":"Floudas, C.A.: Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, Oxford (1995)"},{"key":"570_CR36","doi-asserted-by":"crossref","unstructured":"Cardoso, M.F., Salcedo, R.L., Feyo de Azevedo, S., Barbosa, D.: A simulated annealing approach to the solution of MINLP problems. Comput. Chem. Eng. 21, 1349\u20131364 (1997)","DOI":"10.1016\/S0098-1354(97)00015-X"},{"key":"570_CR37","unstructured":"Nzengang, F.V: Introduction to mixed integer nonlinear programming. M.Sc. dissertation, African Institute for Mathematical Sciences (2010)"},{"issue":"1","key":"570_CR38","doi-asserted-by":"crossref","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. Glob. Optim. 6(1), 39\u201376 (1995)","journal-title":"J. Glob. Optim."},{"key":"570_CR39","unstructured":"Polisetty, P.K., Gatzke, E.P.: A decomposition-based MINLP solution method using piecewise linear relaxations. Int. Trans. Oper. Res. (2005)"},{"key":"570_CR40","volume-title":"Handbook of Test Problems in Local and Global Optimization","author":"CA Floudas","year":"2013","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, C., Esposito, W.R., G\u00fcm\u00fcs, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems in Local and Global Optimization. Springer, Berlin (2013)"},{"issue":"7","key":"570_CR41","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/0098-1354(89)85053-7","volume":"13","author":"GR Kocis","year":"1989","unstructured":"Kocis, G.R., Grossmann, I.E.: A modelling and decomposition strategy for the MINLP optimization of process flowsheets. Comput. Chem. Eng. 13(7), 797\u2013819 (1989)","journal-title":"Comput. Chem. Eng."},{"key":"570_CR42","doi-asserted-by":"crossref","first-page":"S445","DOI":"10.1016\/S0098-1354(97)87542-4","volume":"21","author":"CS Adjiman","year":"1997","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: Global optimization of MINLP problems in process synthesis and design. Comput. Chem. Eng. 21, S445\u2013S450 (1997)","journal-title":"Comput. Chem. Eng."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0570-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0570-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0570-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T14:23:04Z","timestamp":1659536584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0570-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,27]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["570"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0570-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2017,9,27]]}}}