{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T17:15:01Z","timestamp":1648833301466},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s11390-012-1260-x","type":"journal-article","created":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T08:31:36Z","timestamp":1342168296000},"page":"744-753","source":"Crossref","is-referenced-by-count":1,"title":["A Parallel Interval Computation Model for Global Optimization with Automatic Load Balancing"],"prefix":"10.1007","volume":"27","author":[{"given":"Yong","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arun","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,12]]},"reference":[{"key":"1260_CR1","doi-asserted-by":"crossref","unstructured":"Hansen P, Jaumard B. Lipschitz optimization. In Handbook of Global Optimization, Horst R, Pardalos P M (eds.), Dordrecht: Kluwer Academic Pulishers, 1995, pp.407\u2013493.","DOI":"10.1007\/978-1-4615-2025-2_9"},{"issue":"9","key":"1260_CR2","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/S0305-0548(99)00054-4","volume":"27","author":"L \u00d6zdamar","year":"2000","unstructured":"\u00d6zdamar L, Demirhan M B. Experiments with new stochastic global optimization search techniques. Computers and Operations Research, 2000, 27(9): 841\u2013865.","journal-title":"Computers and Operations Research"},{"key":"1260_CR3","volume-title":"Global Optimization Using Interval Analysis","author":"E Hansen","year":"1992","unstructured":"Hansen E. Global Optimization Using Interval Analysis. New York: Marcel Dekker, 1992."},{"key":"1260_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2495-0","volume-title":"Rigorous Global Search: Continuous Problems","author":"RB Kearfott","year":"1996","unstructured":"Kearfott R B. Rigorous Global Search: Continuous Problems. Dordrecht: Kluwer Academic Publisher, 1996."},{"key":"1260_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/02331938808843322","volume":"19","author":"J Pint\u00e9r","year":"1988","unstructured":"Pint\u00e9r J. Branch and bound algorithms for solving global optimization problems with lipschitzian structure. Optimization, 1988, 19: 101\u2013110.","journal-title":"Optimization"},{"issue":"11","key":"1260_CR6","doi-asserted-by":"crossref","first-page":"2235","DOI":"10.1109\/9.333768","volume":"39","author":"ZB Tang","year":"1994","unstructured":"Tang Z B. Adaptive partitioned random search to global optimization. IEEE Transactions on Automatic Control, 1994, 39(11): 2235\u20132244.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"1260_CR7","doi-asserted-by":"crossref","unstructured":"Ratschek H, Rokne J. Interval methods. In Handbook of Global Optimization, Horst R, Pardalos P M (eds.), Kluwer Academic Publishers, 1995, pp.751\u2013828.","DOI":"10.1007\/978-1-4615-2025-2_14"},{"issue":"2","key":"1260_CR8","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/280277.280278","volume":"30","author":"DB Skillicorn","year":"1998","unstructured":"Skillicorn D B, Talia D. Models and languages for parallel computation. ACM Computing Surveys, 1998, 30(2): 123\u2013169.","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"1260_CR9","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 Numerical Mathematics, 1974, 14(1): 87\u201395.","journal-title":"BIT Numerical Mathematics"},{"key":"1260_CR10","doi-asserted-by":"crossref","unstructured":"Hansen E, Sengupta S. Global constrained optimization using interval analysis. In Interval Mathematics, Nickel K (ed.), Berlin: Springer-Verlag, 1980, pp.25\u201347.","DOI":"10.1016\/B978-0-12-518850-0.50008-1"},{"key":"1260_CR11","volume-title":"Interval Analysis","author":"RE Moore","year":"1966","unstructured":"Moore R E. Interval Analysis. Engelwood Cliffs: Prentice Hall, 1966."},{"issue":"2","key":"1260_CR12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01097060","volume":"7","author":"D Ratz","year":"1995","unstructured":"Ratz D, Csendes T. On the selection of subdivision directions in interval branch-and-bound methods for global optimization. Journal of Global Optimization, 1995, 7(2): 183\u2013207.","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"1260_CR13","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1023\/A:1021991817955","volume":"41","author":"LG Casado","year":"2001","unstructured":"Casado L G, Garc\u00eda I, Csendes T. A heuristic rejection criterion in interval global optimization algorithms. BIT Numerical Mathematics, 2001, 41(4): 683\u2013692.","journal-title":"BIT Numerical Mathematics"},{"issue":"3","key":"1260_CR14","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/A:1011220023072","volume":"19","author":"LG Casado","year":"2001","unstructured":"Casado L G, Mart\u00ednez J A, Garc\u00eda I. Experiments with a new selection criterion in a fast interval optimization algorithm. Journal of Global Optimization, 2001, 19(3): 247\u2013264.","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"1260_CR15","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/A:1011228208051","volume":"19","author":"T Csendes","year":"2001","unstructured":"Csendes T. New subinterval selection criteria for interval global optimization. Journal of Global Optimization, 2001, 19(3): 307\u2013327.","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"1260_CR16","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10898-008-9297-7","volume":"42","author":"CS Pedamallu","year":"2008","unstructured":"Pedamallu C S, \u00d6zdamar L, Csendes T, Vink\u00f3 T. Efficient interval partitioning for constrained global optimization. Journal of Global Optimization, 2008, 42(3): 369\u2013384.","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"1260_CR17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10898-009-9472-5","volume":"47","author":"M Sun","year":"2010","unstructured":"Sun M. A fast memoryless interval-based algorithm for global optimization. Journal of Global Optimization, 2010, 47(2): 247\u2013271.","journal-title":"Journal of Global Optimization"},{"key":"1260_CR18","unstructured":"Henriksen T, Madsen K. Use of a depth-first strategy in parallel global optimization. Technical Report 92-10, Institute of Numerical Analysis, Technical University of Denmark, Lyngby, 1992."},{"issue":"1","key":"1260_CR19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02390523","volume":"1","author":"J Eriksson","year":"1995","unstructured":"Eriksson J, Lindstrom P. A parallel interval method implementation for global optimization using dynamic load balancing. Reliable Computing, 1995, 1(1): 77\u201391.","journal-title":"Reliable Computing"},{"key":"1260_CR20","doi-asserted-by":"crossref","unstructured":"Benyoub A, Daoudi E M. Parallelization of the continuous global optimization problem with inequality constraints by using interval arithmetic. In Proc. the 9th International Conference on High-Performance Computing and Networking, June 2001, pp.595\u2013602.","DOI":"10.1007\/3-540-48228-8_68"},{"key":"1260_CR21","doi-asserted-by":"crossref","unstructured":"Ibraev S. A new parallel method for verified global optimization [PhD Thesis]. University of Wuppertal, Germany, 2001.","DOI":"10.1002\/1617-7061(200203)1:1<470::AID-PAMM470>3.0.CO;2-B"},{"key":"1260_CR22","doi-asserted-by":"crossref","unstructured":"Gau C Y, Stadtherr M A. Parallel interval-Newton using message passing: Dynamic load balancing strategies. In Proc. the 2001 ACM\/IEEE Conference on Supercomputing, Denver, Colorado, Nov. 2001, Article No.23.","DOI":"10.1145\/582034.582057"},{"issue":"1","key":"1260_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00121748","volume":"9","author":"S Berner","year":"1996","unstructured":"Berner S. Parallel methods for verified global optimization practice and theory. Journal of Global Optimization, 1996, 9(1): 1\u201322.","journal-title":"Journal of Global Optimization"},{"key":"1260_CR24","unstructured":"Message Passing Interface Forum. MPI: The message passing interface standard. 1994, http:\/\/www.mpi-forum.org , 2011."},{"key":"1260_CR25","unstructured":"Wu Y, Kumar A. Interval subdivision strategies for constrained optimization. In Proc. the International Conference of Numerical Analysis and Applied Mathematics, Sept. 2005, pp.593\u2013596."},{"key":"1260_CR26","unstructured":"Ratschek H, Rokne J. New Computer Methods for Global Optimization. Ellis Horwood Limited, 1988."},{"key":"1260_CR27","doi-asserted-by":"crossref","unstructured":"Floudas C A, Pardalos P M, Adjiman C\u00a0S, Esposito W R, G\u00fcm\u00fcs Z H, Harding S\u00a0T, Klepeis J\u00a0L, Meyer C A, Schweiger C A. Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers, 1999.","DOI":"10.1007\/978-1-4757-3040-1"},{"key":"1260_CR28","doi-asserted-by":"crossref","unstructured":"Michalewicz Z. Genetic Algorithms\u2009+\u2009Data Structures\u2009=\u2009Evolution Programs. Springer, 1996.","DOI":"10.1007\/978-3-662-03315-9"},{"key":"1260_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-50871-6","volume-title":"Global Optimization","author":"A T\u00f6rn","year":"1989","unstructured":"T\u00f6rn A, \u017dilinskas A. Global Optimization. Berlin: Springer-Verlag, 1989."},{"key":"1260_CR30","doi-asserted-by":"crossref","unstructured":"M\u00e4kel\u00e4 M\u00a0M, Neittaanm\u00e4ki P. Nonsmooth Optimization. World Scientific, 1992.","DOI":"10.1142\/1493"},{"key":"1260_CR31","unstructured":"CUTEr. CUTEr: A constrained and unconstrained testing environment, revisited. http:\/\/cuter.rl.ac.uk\/ , 2011."},{"key":"1260_CR32","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF02307379","volume":"53","author":"O Kn\u00fcppel","year":"1994","unstructured":"Kn\u00fcppel O. PROFILE\/BIAS \u2014 A fast interval library. Computing, 1994, 53: 277\u2013287.","journal-title":"Computing"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1260-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-012-1260-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1260-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T21:37:57Z","timestamp":1561930677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-012-1260-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1260"],"URL":"https:\/\/doi.org\/10.1007\/s11390-012-1260-x","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}