{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T02:26:51Z","timestamp":1689042411596},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T00:00:00Z","timestamp":1181088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2007,11,1]]},"DOI":"10.1007\/s10898-007-9157-x","type":"journal-article","created":{"date-parts":[[2007,6,5]],"date-time":"2007-06-05T09:47:58Z","timestamp":1181036878000},"page":"577-593","source":"Crossref","is-referenced-by-count":12,"title":["Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints"],"prefix":"10.1007","volume":"39","author":[{"given":"Leocadio G.","family":"Casado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eligius M. T.","family":"Hendrix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inmaculada","family":"Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,6]]},"reference":[{"key":"9157_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10898-004-4312-0","volume":"33","author":"K.M. Anstreicher","year":"2005","unstructured":"Anstreicher K.M., Burer S. (2005). D.C. versus copositive bounds for standard QP. J. Global Optim. 33: 299\u2013312","journal-title":"J. Global Optim."},{"key":"9157_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"I.M. Bomze","year":"2002","unstructured":"Bomze I.M., de Klerk E. (2002). Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24: 163\u2013185","journal-title":"J. Global Optim."},{"key":"9157_CR3","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1016\/S0898-1221(02)00205-5","volume":"44","author":"J. Claussen","year":"2002","unstructured":"Claussen J., Zilinskas A. (2002). Subdivision, sampling and initialization strategies for simplical branch and bound in global optimization. Comput. Math. Appl. 44: 943\u2013955","journal-title":"Comput. Math. Appl."},{"key":"9157_CR4","volume-title":"Global Optimization at Work","author":"E.M.T. Hendrix","year":"1998","unstructured":"Hendrix E.M.T. (1998). Global Optimization at Work. Wageningen University, Wageningen"},{"issue":"2","key":"9157_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1008394806170","volume":"18","author":"E.M.T. Hendrix","year":"2000","unstructured":"Hendrix E.M.T., Klepper O. (2000). On uniform covering, adaptive random search and raspberries. J. Global Optim. 18(2): 143\u2013163","journal-title":"J. Global Optim."},{"key":"9157_CR6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF00130833","volume":"1","author":"E.M.T. Hendrix","year":"1991","unstructured":"Hendrix E.M.T., Pint\u00e9r J.D. (1991). An application of Lipschitzian global optimization to product design. J. Global Optim. 1: 389\u2013401","journal-title":"J. Global Optim."},{"key":"9157_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/0377-2217(95)00082-8","volume":"92","author":"E.M.T. Hendrix","year":"1996","unstructured":"Hendrix E.M.T., Mecking C.J., Hendriks T.H.B. (1996). Finding robust solutions for product design problems. Eur. J. Oper. Res. 92: 28\u201336","journal-title":"Eur. J. Oper. Res."},{"key":"9157_CR8","doi-asserted-by":"crossref","unstructured":"Hendrix, E.M.T., Casado, L.G., Garc\u00eda, I.: The semi-continous quadratic mixture design problem. Description and branch-and-bound approach. In press, doi:10.1016\/j.ejor.2007.01.056 (2007). Eur. J. Oper. Res.","DOI":"10.1016\/j.ejor.2007.01.056"},{"issue":"218","key":"9157_CR9","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1090\/S0025-5718-97-00809-0","volume":"66","author":"R. Horst","year":"1997","unstructured":"Horst R. (1997). On generalized bisection of n-simplices. Math. Comput. 66(218): 691\u2013698","journal-title":"Math. Comput."},{"key":"9157_CR10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00998631","volume":"5","author":"T. Ibaraki","year":"1976","unstructured":"Ibaraki T. (1976). Theoretical comparisons of search strategies in branch and bound algorithms. Int. J. Comput. Inform. Sci. 5: 315\u2013344","journal-title":"Int. J. Comput. Inform. Sci."},{"key":"9157_CR11","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF00938542","volume":"57","author":"C.C. Meewella","year":"1988","unstructured":"Meewella C.C., Mayne D.Q. (1988). An algorithm for global optimization of Lipschitz continuous functions. J. Optim. Theory Appl. 57: 307\u2013322","journal-title":"J. Optim. Theory Appl."},{"key":"9157_CR12","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/opre.18.1.24","volume":"18","author":"L.G. Mitten","year":"1970","unstructured":"Mitten L.G. (1970). Branch and bound methods: general formulation and properties. Opera. Res. 18: 24\u201334","journal-title":"Opera. Res."},{"key":"9157_CR13","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/BF01580583","volume":"34","author":"R.H. Mladineo","year":"1986","unstructured":"Mladineo R.H. (1986). An algorithm for finding the global maximum of a multimodal, multivariate function. Math. Program. 34: 188\u2013200","journal-title":"Math. Program."},{"key":"9157_CR14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/02331938808843322","volume":"19","author":"J.D. Pint\u00e9r","year":"1988","unstructured":"Pint\u00e9r J.D. (1988). Branch-and-bound algorithms for solving global optimization problems with Lipschitzian structure. Optimization 19: 101\u2013110","journal-title":"Optimization"},{"key":"9157_CR15","volume-title":"Model Building in Mathematical Programming","author":"H.P. Williams","year":"1993","unstructured":"Williams H.P. (1993). Model Building in Mathematical Programming. Wiley & Sons, Chichester"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9157-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-007-9157-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9157-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T08:12:08Z","timestamp":1559290328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-007-9157-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,6]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,11,1]]}},"alternative-id":["9157"],"URL":"https:\/\/doi.org\/10.1007\/s10898-007-9157-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,6]]}}}