{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:41:34Z","timestamp":1766486494825},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319091280"},{"type":"electronic","value":"9783319091297"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09129-7_11","type":"book-chapter","created":{"date-parts":[[2014,7,3]],"date-time":"2014-07-03T08:21:21Z","timestamp":1404375681000},"page":"140-153","source":"Crossref","is-referenced-by-count":4,"title":["Branch and Bound Based Coordinate Search Filter Algorithm for Nonsmooth Nonconvex Mixed-Integer Nonlinear Programming Problems"],"prefix":"10.1007","author":[{"given":"Florbela P.","family":"Fernandes","sequence":"first","affiliation":[]},{"given":"M. Fernanda P.","family":"Costa","sequence":"additional","affiliation":[]},{"given":"Edite M. G. P.","family":"Fernandes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"11_CR1","first-page":"477","volume":"3","author":"M.A. Abramson","year":"2007","unstructured":"Abramson, M.A., Audet, C., Dennis Jr., J.E.: Filter pattern search algorithms for mixed variable constrained optimization problems. Pac. J. Optim.\u00a03(3), 477\u2013500 (2007)","journal-title":"Pac. J. Optim."},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1137\/S105262340138983X","volume":"14","author":"C. Audet","year":"2004","unstructured":"Audet, C., Dennis Jr., J.E.: A pattern search filter method for nonlinear programming without derivatives. SIAM J. Optimiz.\u00a014(4), 980\u20131010 (2004)","journal-title":"SIAM J. Optimiz."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492913000032","volume":"22","author":"P. Belotti","year":"2013","unstructured":"Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Mahajan, A.: Mixed-Integer Nonlinear Optimization. Acta Numer.\u00a022, 1\u2013131 (2013)","journal-title":"Acta Numer."},{"key":"11_CR4","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 bound tightening techniques for non-convex MINLP. Opt. Methods Softw.\u00a024, 597\u2013634 (2009)","journal-title":"Opt. Methods Softw."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.sorms.2012.08.001","volume":"17","author":"S. Burer","year":"2012","unstructured":"Burer, S., Letchford, A.: Non-convex mixed-integer nonlinear programming: a survey. Surveys in Operations Research and Management Science\u00a017, 97\u2013106 (2012)","journal-title":"Surveys in Operations Research and Management Science"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"M.R. Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: Minlplib \u2013 a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput.\u00a015(1), 1\u20135 (2003), \n                    \n                      http:\/\/www.gamsworld.org\/minlp\/minlplib\/minlpstat.htm","journal-title":"INFORMS J. Comput."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"R.J. Dakin","year":"1965","unstructured":"Dakin, R.J.: A tree search algorithm for mixed integer programming problems. Comput. J.\u00a08, 250\u2013255 (1965)","journal-title":"Comput. J."},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10107-012-0608-x","volume":"136","author":"C. D\u2019Ambrosio","year":"2012","unstructured":"D\u2019Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: A storm of feasibility pumps for nonconvex MINLP. Math. Program., Ser. B\u00a0136(2), 375\u2013402 (2012)","journal-title":"Math. Program., Ser. B"},{"key":"11_CR9","unstructured":"Fernandes, F.P., Costa, M.F.P., Fernandes, E.M.G.P.: Assessment of a hybrid approach for nonconvex constrained MINLP problems. In: Proceedings of the 2011 International Conference on Computational and Mathematical Methods in Science and Engineering, pp. 484\u2013495 (2011)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-31137-6_8","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2012","author":"F.P. Fernandes","year":"2012","unstructured":"Fernandes, F.P., Costa, M.F.P., Fernandes, E.M.G.P.: A derivative-free filter driven multistart technique for global optimization. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part III. LNCS, vol.\u00a07335, pp. 103\u2013118. Springer, Heidelberg (2012)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-39637-3_27","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2013","author":"F.P. Fernandes","year":"2013","unstructured":"Fernandes, F.P., Costa, M.F.P., Fernandes, E.M.G.P.: Multilocal programming: A derivative-free filter multistart algorithm. In: Murgante, B., Misra, S., Carlini, M., Torre, C.M., Nguyen, H.-Q., Taniar, D., Apduhan, B.O., Gervasi, O. (eds.) ICCSA 2013, Part I. LNCS, vol.\u00a07971, pp. 333\u2013346. Springer, Heidelberg (2013)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Fernandes, F.P., Costa, M.F.P., Fernandes, E.M.G.P., Rocha, A.M.A.C.: Multistart Hooke and Jeeves filter method for mixed variable optimization. In: Simos, T.E., Psihoyios, G. (eds.) International Conference of Numerical Analysis and Applied Mathematics. AIP Conf. Proc., vol.\u00a01558, pp. 614\u2013617 (2013)","DOI":"10.1063\/1.4825566"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R. Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program.\u00a091, 239\u2013269 (2002)","journal-title":"Math. Program."},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.compchemeng.2012.03.001","volume":"42","author":"T. Gueddar","year":"2012","unstructured":"Gueddar, T., Dua, V.: Approximate multi-parametric programming based B&B algorithm for MINLPs. Comput. Chem. Eng.\u00a042, 288\u2013297 (2012)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.3934\/naco.2011.1.99","volume":"1","author":"A. Hedar","year":"2011","unstructured":"Hedar, A., Fahim, A.: Filter-based genetic algorithm for mixed variable programming. Numerical Algebra, Control and Optimization\u00a01(1), 99\u2013116 (2011)","journal-title":"Numerical Algebra, Control and Optimization"},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"T.G. 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.\u00a045(3), 385\u2013482 (2003)","journal-title":"SIAM Rev."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.amc.2007.08.001","volume":"197","author":"I.E. Lagaris","year":"2008","unstructured":"Lagaris, I.E., Tsoulos, I.G.: Stopping rules for box-constrained stochastic global optimization. Appl. Math. Comput.\u00a0197, 622\u2013632 (2008)","journal-title":"Appl. Math. Comput."},{"key":"11_CR18","doi-asserted-by":"publisher","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.\u00a018, 295\u2013309 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1016\/j.asoc.2010.05.007","volume":"10","author":"T.W. Liao","year":"2010","unstructured":"Liao, T.W.: Two hybrid differential evolution algorithms for engineering design optimization. Appl. Soft Comput.\u00a010, 1188\u20131199 (2010)","journal-title":"Appl. Soft Comput."},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s12532-011-0031-y","volume":"3","author":"L. Liberti","year":"2011","unstructured":"Liberti, L., Mladenovi\u0107, N., Nannicini, G.: A recipe for finding good solutions to MINLPs. Math. Prog. Comp.\u00a03, 349\u2013390 (2011)","journal-title":"Math. Prog. Comp."},{"issue":"5","key":"11_CR21","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"H.S. 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.\u00a019(5), 551\u2013566 (1995)","journal-title":"Comput. Chem. Eng."},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1016\/j.cor.2008.08.015","volume":"36","author":"M. Schl\u00fcter","year":"2009","unstructured":"Schl\u00fcter, M., Egea, J.A., Banga, J.R.: Extended ant colony optimization for non-convex mixed integer nonlinear programming. Comput. Oper. Res.\u00a036, 2217\u20132229 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"11_CR23","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.\u00a0103(2), 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.amc.2009.03.012","volume":"213","author":"C. Voglis","year":"2009","unstructured":"Voglis, C., Lagaris, I.E.: Towards \u201cIdeal Multistart\u201d. A stochastic approach for locating the minima of a continuous function inside a bounded domain. Appl. Math. Comput.\u00a0213, 1404\u20131415 (2009)","journal-title":"Appl. Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09129-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T05:49:47Z","timestamp":1558936187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09129-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091280","9783319091297"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09129-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}