{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T02:26:02Z","timestamp":1689042362819},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10898-011-9771-5","type":"journal-article","created":{"date-parts":[[2011,9,6]],"date-time":"2011-09-06T13:39:28Z","timestamp":1315316368000},"page":"821-844","source":"Crossref","is-referenced-by-count":7,"title":["On estimating workload in interval branch-and-bound global optimization algorithms"],"prefix":"10.1007","volume":"56","author":[{"given":"Jos\u00e9 L.","family":"Berenguel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. G.","family":"Casado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eligius M. T.","family":"Hendrix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,6]]},"reference":[{"key":"9771_CR1","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. J. Glob. Optim. 9, 1\u201322 (1996). doi: 10.1007\/BF00121748","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9771_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1023\/A:1024731306785","volume":"118","author":"L. Casado","year":"2003","unstructured":"Casado L., Garc\u00eda I., Csendes T., Ru\u00edz V.: Heuristic rejection in interval global optimization. J. Optim. Theory Appl. (JOTA) 118(1), 27\u201343 (2003). doi: 10.1023\/A:1024731306785","journal-title":"J. Optim. Theory Appl. (JOTA)"},{"key":"9771_CR3","unstructured":"Colville, A.R.: A comparative study of nonlinear programming codes. Technical report 320-2949. IBM Scientific Center, New York (1968)"},{"issue":"1","key":"9771_CR4","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/ijoc.1040.0107","volume":"18","author":"G. Cornu\u00e9jols","year":"2006","unstructured":"Cornu\u00e9jols G., Karamanov M., Li Y.: Early estimates of the size of branch-and-bound trees. INFORMS J. Comput. 18(1), 86\u201396 (2006). doi: 10.1287\/ijoc.1040.0107","journal-title":"INFORMS J. Comput."},{"key":"9771_CR5","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1137\/S0036142995281528","volume":"34","author":"T. Csendes","year":"1997","unstructured":"Csendes T., Ratz D.: Subdivision direction selection in interval methods for global optimization. SIAM J. Numer. Anal. 34, 922\u2013938 (1997)","journal-title":"SIAM J. Numer. Anal."},{"key":"9771_CR6","unstructured":"Dixon L., Szego G. (ed.): Towards Global Optimization 2. North-Holland Publishing Company, Amsterdam (1978)"},{"issue":"1","key":"9771_CR7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02390523","volume":"1","author":"J. Eriksson","year":"1995","unstructured":"Eriksson J., Lindstr\u00f6m P.: A parallel interval method implementation for global optimization using dynamic load balancing. Reliab. Comput. 1(1), 77\u201391 (1995). doi: 10.1007\/BF02390523","journal-title":"Reliab. Comput."},{"key":"9771_CR8","doi-asserted-by":"crossref","unstructured":"Ferreira A., Pardalos P. (eds.): Solving combinatorial optimization problems in parallel. In: Lecture Notes in Computer Science, vol. 1054. Springer, Berlin (1996). doi: 10.1007\/BFb0027115","DOI":"10.1007\/BFb0027115"},{"issue":"2","key":"9771_CR9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/22719.24067","volume":"9","author":"R. Finkel","year":"1987","unstructured":"Finkel R., Manber U.: A distributed implementation of backtracking. ACM Trans. Program. Lang. Syst. 9(2), 235\u2013256 (1987)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"9","key":"9771_CR10","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1016\/S0305-0548(96)00094-9","volume":"24","author":"B. Gendron","year":"1997","unstructured":"Gendron B., Crainic T.: A parallel branch-and-bound algorithm for multicommodity location with balancing requirements. Comput. Oper. Res. 24(9), 829\u2013847 (1997). doi: 10.1016\/S0305-0548(96)00094-9","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9771_CR11","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"B. Gendron","year":"1994","unstructured":"Gendron B., Crainic T.G.: Parallel branch-and-bound algorithms: survey and synthesis. Oper. Res. 42(6), 1042\u20131066 (1994)","journal-title":"Oper. Res."},{"key":"9771_CR12","volume-title":"Global Optimization Using Interval Analysis","author":"E.R. Hansen","year":"2004","unstructured":"Hansen E.R., Walster G.W.: Global Optimization Using Interval Analysis. 2nd edn. Marcel Dekker, New York (2004)","edition":"2"},{"issue":"5","key":"9771_CR13","first-page":"88","volume":"3","author":"T. Henriksen","year":"1992","unstructured":"Henriksen T., Madsen K.: Parallel algorithms for global optimization. Interval Comput. 3(5), 88\u201395 (1992)","journal-title":"Interval Comput."},{"key":"9771_CR14","unstructured":"Henriksen, T., Madsen, K.: Use of a depth-first strategy in parallel global optimization. Technical report EUR-CS-92-10, Institute for Numerical Analysis, Technical University of Denmark (1992)"},{"key":"9771_CR15","doi-asserted-by":"crossref","unstructured":"Ibraev, S.: A new parallel method for verified global optimization. Ph.D. thesis, University of Wuppertal, Wuppertal (2001)","DOI":"10.1002\/1617-7061(200203)1:1<470::AID-PAMM470>3.0.CO;2-B"},{"key":"9771_CR16","unstructured":"Kahou, J.: Some new acceleration mechanisms in verified global optimization. Ph.D. thesis, Bergischen Unviersit\u00e4t Wuppertal (2005)"},{"key":"9771_CR17","unstructured":"Kilby, P., Slaney, J., Thi\u00e9baux, S., Walsh, T.: Estimating search tree size. In: AAAI\u201906: Proceedings of the 21st National Conference on Artificial Intelligence, pp.1014\u20131019. AAAI Press, HJ (2006)"},{"issue":"129","key":"9771_CR18","doi-asserted-by":"crossref","first-page":"121","DOI":"10.2307\/2005469","volume":"29","author":"D. Knuth","year":"1975","unstructured":"Knuth D.: Estimating the efficiency of backtrack programs. Math. Comput. 29(129), 121\u2013136 (1975)","journal-title":"Math. Comput."},{"issue":"3","key":"9771_CR19","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A. Land","year":"1960","unstructured":"Land A., Doig A.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497\u2013520 (1960)","journal-title":"Econometrica"},{"key":"9771_CR20","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-8191(93)90044-L","volume":"19","author":"P. Laursen","year":"1993","unstructured":"Laursen P.: Simple approaches to parallel branch and bound. Parallel Comput. 19, 143\u2013152 (1993)","journal-title":"Parallel Comput."},{"key":"9771_CR21","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","volume":"11","author":"J. Little","year":"1963","unstructured":"Little J., Murty K., Sweeney D., Karel C.: An algorithm for the traveling salesman problem. Oper. Res. 11, 972\u2013989 (1963)","journal-title":"Oper. Res."},{"key":"9771_CR22","volume-title":"Interval Analysis","author":"R. Moore","year":"1966","unstructured":"Moore R.: Interval Analysis. Prentice-Hall, New Jersey (1966)"},{"key":"9771_CR23","unstructured":"Moore, R., Hansen, E., Leclerc, A.: Rigorous methods for global optimization. In: Recent Advances in Global Optimization. Princeton University Press, Princeton, NJ, USA, (1992)"},{"key":"9771_CR24","doi-asserted-by":"crossref","unstructured":"Moore, R., Kearfott, R., Cloud, M.: Introduction to Interval Analysis. SIAM, Philadelphia (2009)","DOI":"10.1137\/1.9780898717716"},{"key":"9771_CR25","volume-title":"Interval Methods for Systems of Equations","author":"A. Neumaier","year":"1990","unstructured":"Neumaier A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)"},{"issue":"3","key":"9771_CR26","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1287\/ijoc.1100.0405","volume":"23","author":"O. \u00d6zalt\u0131n","year":"2011","unstructured":"Hunsaker O., Hunsaker B., Schaefer A.: Predicting the solution time of branch-and-bound algorithms for mixed-integer programs. INFORMS J. Comput. 23(3), 392\u2013403 (2011). doi: 10.1287\/ijoc.1100.0405","journal-title":"INFORMS J. Comput."},{"key":"9771_CR27","doi-asserted-by":"crossref","unstructured":"Pardalos, P. (ed.): Parallel processing of discrete problems. In: The IMA Volumes in Mathematics and its Applications, vol. 106. Springer, Berlin (1999)","DOI":"10.1007\/978-1-4612-1492-2"},{"key":"9771_CR28","doi-asserted-by":"crossref","unstructured":"Pardalos, P., Resende, M., Ramakrishnan, K. (eds.): Parallel processing of discrete optimization problems: DIMACS workshop, 28\u201329 April 1994. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 22. American Mathematical Society (1995)","DOI":"10.1090\/dimacs\/022"},{"issue":"6","key":"9771_CR29","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/BF01389000","volume":"16","author":"V. Rao","year":"1987","unstructured":"Rao V., Kumar V.: Parallel depth first search. part I. Implementation. Int. J. Parallel Program. 16(6), 479\u2013499 (1987). doi: 10.1007\/BF01389000","journal-title":"Int. J. Parallel Program."},{"key":"9771_CR30","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. J. Glob. Optim. 7, 183\u2013207 (1995)","journal-title":"J. Glob. Optim."},{"key":"9771_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-50871-6","volume-title":"Global Optimization, vol. 350","author":"A. T\u00f6rn","year":"1989","unstructured":"T\u00f6rn A., \u017dilinskas A.: Global Optimization, vol. 350. Springer, Berlin (1989)"},{"key":"9771_CR32","unstructured":"Trienekens, H., De Bruin, A.: Towards a taxonomy of parallel branch and bound algorithms. Technical report EUR-CS-92-01. Erasmus University Rotterdam (1992)"},{"key":"9771_CR33","unstructured":"Wiethoff, A.: Verifizierte Globale Optimierung auf Parallelrechnern. Ph.D. thesis, Universit\u00e4t Karlsruhe, Karlsruhe (1998)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9771-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T21:06:55Z","timestamp":1560546415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-011-9771-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,6]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9771"],"URL":"https:\/\/doi.org\/10.1007\/s10898-011-9771-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,6]]}}}