{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:13:38Z","timestamp":1649204018701},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,9,19]],"date-time":"2009-09-19T00:00:00Z","timestamp":1253318400000},"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":[[2010,6]]},"DOI":"10.1007\/s10898-009-9472-5","type":"journal-article","created":{"date-parts":[[2009,9,18]],"date-time":"2009-09-18T10:38:17Z","timestamp":1253270297000},"page":"247-271","source":"Crossref","is-referenced-by-count":5,"title":["A fast memoryless interval-based algorithm for global optimization"],"prefix":"10.1007","volume":"47","author":[{"given":"M.","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,19]]},"reference":[{"key":"9472_CR1","volume-title":"Introduction to Interval Computations","author":"G. Alefeld","year":"1983","unstructured":"Alefeld G., Herzberger J.: Introduction to Interval Computations. Academic Press, New York (1983)"},{"key":"9472_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0305-0548(00)00064-2","volume":"29","author":"M.M. Ali","year":"2002","unstructured":"Ali M.M., Torn A., Viitanen S.: A direct search variant of the simulated annealing algorithm for optimization involving continuous variables. Comput. Oper. Res. 29, 87\u2013102 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9472_CR3","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1109\/21.108301","volume":"21","author":"G.L. Bilbro","year":"1991","unstructured":"Bilbro G.L., Snyder W.E.: Optimization of functions with many minima. IEEE Trans. Syst. Man Cybern. 21(4), 840\u2013849 (1991)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"9472_CR4","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1016\/S0898-1221(02)00205-5","volume":"44","author":"J. Clausen","year":"2002","unstructured":"Clausen J., Zilinskas A.: Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. Comput. Math. Appl. 44, 943\u2013955 (2002)","journal-title":"Comput. Math. Appl."},{"key":"9472_CR5","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1016\/S0898-1221(01)00219-X","volume":"42","author":"A.E. Csallner","year":"2001","unstructured":"Csallner A.E.: Lipschitz continuity and the termination of interval methods for global optimization. Comput. Math. Appl. 42, 1035\u20131042 (2001)","journal-title":"Comput. Math. Appl."},{"key":"9472_CR6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0898-1221(95)00229-4","volume":"31","author":"A.E. Csallner","year":"1996","unstructured":"Csallner A.E., Csendes T.: The convergence speed of interval methods for global optimization. Comput. Math. Appl. 31, 173\u2013178 (1996)","journal-title":"Comput. Math. Appl."},{"key":"9472_CR7","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1126\/science.267.5198.664","volume":"267","author":"D. Cvijovic","year":"1995","unstructured":"Cvijovic D., Klinowski J.: Tabu search: an approach to the multiple minima problem. Science 267, 664\u2013666 (1995)","journal-title":"Science"},{"key":"9472_CR8","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"J.E. Falk","year":"1969","unstructured":"Falk J.E., Soland R.M.: An algorithm for separable nonconvex programming problems. Manag. Sci. 15, 550\u2013569 (1969)","journal-title":"Manag. Sci."},{"key":"9472_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53032-0","volume-title":"A Collection of Test Problems for Constrained Global Optimization Algorithms","author":"C.A. Floudas","year":"1990","unstructured":"Floudas C.A., Pardalos P.M.: A Collection of Test Problems for Constrained Global Optimization Algorithms. Springer, Berlin (1990)"},{"issue":"3","key":"9472_CR10","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover F.: Tabu search\u2014part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"key":"9472_CR11","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"9472_CR12","volume-title":"Global Optimization Using Interval Analysis","author":"E.R. Hansen","year":"1992","unstructured":"Hansen E.R.: Global Optimization Using Interval Analysis. Marcel Dekker, NY (1992)"},{"key":"9472_CR13","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s10898-005-3693-z","volume":"35","author":"A.R. Hedar","year":"2006","unstructured":"Hedar A.R., Fukushima M.: Derivative-free filter simulated annealing method for constrained continuous global optimization. J. Glob. Optim. 35, 521\u2013549 (2006)","journal-title":"J. Glob. Optim."},{"key":"9472_CR14","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01580678","volume":"10","author":"R. Horst","year":"1976","unstructured":"Horst R.: An algorithm for nonconvex programming problems. Math. Program. 10, 312\u2013321 (1976)","journal-title":"Math. Program."},{"key":"9472_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02598-7","volume-title":"Global Optimization, Deterministic Approaches","author":"R. Horst","year":"1990","unstructured":"Horst R., Tuy H.: Global Optimization, Deterministic Approaches. Springer, Berlin (1990)"},{"key":"9472_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF02252616","volume":"23","author":"K. Ichida","year":"1979","unstructured":"Ichida K., Fujii Y.: An interval arithmetic method for global optimization. Computing 23, 85\u201397 (1979)","journal-title":"Computing"},{"key":"9472_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-1-4613-3440-8_2","volume-title":"Applications of Interval Computations (El Paso, TX), Applied Optimization, vol. 3","author":"R.B. Kearfott","year":"1996","unstructured":"Kearfott R.B.: A review of techniques in the verified solution of constrained global optimization problems. In: Kearfott, R.B., Kreinovich, V. (eds) Applications of Interval Computations (El Paso, TX), Applied Optimization, vol. 3, pp. 23\u201360. Kluwer, Dordrecht (1996)"},{"key":"9472_CR18","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S., Gelatt C.D. Jr, Vecchi M.P.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"9472_CR19","volume-title":"Genetic Algorithms\u00a0+\u00a0Data Structures\u00a0=\u00a0Evolution Programs","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz Z.: Genetic Algorithms\u00a0+\u00a0Data Structures\u00a0=\u00a0Evolution Programs. Springer, Berlin (1996)","edition":"3"},{"key":"9472_CR20","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970906","volume-title":"Methods and Applications of Interval Analysis","author":"R.E. Moore","year":"1979","unstructured":"Moore R.E.: Methods and Applications of Interval Analysis. SIAM Publication, Philadelphia (1979)"},{"key":"9472_CR21","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717716","volume-title":"Introduction to Interval Analysis","author":"R.E. Moore","year":"2009","unstructured":"Moore R.E., Kearfott R.B., Cloud M.J.: Introduction to Interval Analysis. SIAM Publication, Philadelphia (2009)"},{"key":"9472_CR22","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511526473","volume-title":"Interval Methods for Systems of Equations. Encyclopedia of Mathematics and its Applications 37","author":"A. Neumaier","year":"1991","unstructured":"Neumaier A.: Interval Methods for Systems of Equations. Encyclopedia of Mathematics and its Applications 37. Cambridge University Press, Cambridge (1991)"},{"key":"9472_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5362-2","volume-title":"Handbook of Global Optimization\u2014Volume 2: Heuristic Approaches","author":"P.M. Pardalos","year":"2002","unstructured":"Pardalos P.M., Romeijn E.: Handbook of Global Optimization\u2014Volume 2: Heuristic Approaches. Kluwer, Dordrecht (2002)"},{"key":"9472_CR24","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10898-008-9297-7","volume":"42","author":"C.S. Pedamallu","year":"2008","unstructured":"Pedamallu C.S., Ozdamar L., Csendes T., Vinko T.: Efficient interval partitioning approach for global optimization. J. Glob. Optim. 42, 369\u2013384 (2008)","journal-title":"J. Glob. Optim."},{"key":"9472_CR25","volume-title":"New Computer Methods for Global Optimization","author":"H. Ratscheck","year":"1988","unstructured":"Ratscheck H., Rokne J.: New Computer Methods for Global Optimization. Wiley, New York (1988)"},{"issue":"13","key":"9472_CR26","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1002\/(SICI)1097-0207(19970715)40:13<2449::AID-NME172>3.0.CO;2-O","volume":"40","author":"P. Siarry","year":"1997","unstructured":"Siarry P., Berthiau G.: Fitting of Tabu Search to optimize functions of continuous variables. Intern. J. Numer. Methods Eng. 40(13), 2449\u20132457 (1997)","journal-title":"Intern. J. Numer. Methods Eng."},{"key":"9472_CR27","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01933121","volume":"14","author":"S. Skelboe","year":"1974","unstructured":"Skelboe S.: Computation of rational interval functions. BIT 14, 87\u201395 (1974)","journal-title":"BIT"},{"key":"9472_CR28","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R. Storn","year":"1997","unstructured":"Storn R., Price K.: Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11, 341\u2013359 (1997)","journal-title":"J. Glob. Optim."},{"key":"9472_CR29","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10898-004-6097-6","volume":"33","author":"M. Sun","year":"2005","unstructured":"Sun M., Johnson A.W.: Interval branch and bound with local sampling for constrained global optimization. J. Glob. Optim. 33, 61\u201382 (2005)","journal-title":"J. Glob. Optim."},{"key":"9472_CR30","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1023\/A:1020383700229","volume":"24","author":"T. Voorhis Van","year":"2002","unstructured":"Van Voorhis T.: A global optimization algorithm using Lagrangian underestimates and the interval Newton method. J. Glob. Optim. 24, 349\u2013370 (2002)","journal-title":"J. Glob. Optim."},{"key":"9472_CR31","volume-title":"Nonlinear Optimization: Complexity Issues","author":"S.A. Vavasis","year":"1991","unstructured":"Vavasis S.A.: Nonlinear Optimization: Complexity Issues. Oxford University Press, New York (1991)"},{"key":"9472_CR32","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X. Yao","year":"1999","unstructured":"Yao X., Liu Y., Lin G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3, 82\u2013102 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9472_CR33","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1080\/03052150802056188","volume":"40","author":"X. Zhang","year":"2008","unstructured":"Zhang X., Liu S.: Interval algorithm for global numerical optimization. Eng. Optim. 40, 849\u2013868 (2008)","journal-title":"Eng. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-009-9472-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-009-9472-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-009-9472-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:58:54Z","timestamp":1559264334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-009-9472-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,19]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9472"],"URL":"https:\/\/doi.org\/10.1007\/s10898-009-9472-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,19]]}}}