{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T06:04:23Z","timestamp":1709273063024},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1007\/bf02427853","type":"journal-article","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T16:07:42Z","timestamp":1149696462000},"page":"277-301","source":"Crossref","is-referenced-by-count":18,"title":["A randomized parallel branch-and-bound algorithm"],"prefix":"10.1007","volume":"17","author":[{"given":"Virendra K.","family":"Janakiram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward F.","family":"Gehringer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dharma P.","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Mehrotra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02427853_CR1","doi-asserted-by":"crossref","unstructured":"A. C. Yao, Probabilistic Computations: Toward a Unified Measure of Complexity, inProc. 18th Annual IEEE Symp. on Fundamentals of Computer Science, New York, pp. 222\u2013237 (1977).","DOI":"10.1109\/SFCS.1977.24"},{"key":"BF02427853_CR2","doi-asserted-by":"crossref","unstructured":"W. Dobosiewicz, Sorting by Distributive Partitioning,Inf. Proc. Lett., Vol. 7, No. 1, (January 1978).","DOI":"10.1016\/0020-0190(78)90028-5"},{"key":"BF02427853_CR3","unstructured":"M. O. Ruban, Probabilistic Algorithm in Finite Fields, Technical Report, Massachusetts Institute of Technology (1979)."},{"key":"BF02427853_CR4","unstructured":"P. G. Spirakis, Probabilistic Algorithms, Algorithms with Random Inputs and Random Combinatorial Structures, Ph.D. thesis, Harvard University, Department of Mathematics (December 1981)."},{"issue":"12","key":"BF02427853_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0167-6377(84)90069-5","volume":"3","author":"G. L. Thompson","year":"1984","unstructured":"G. L. Thompson and S. Singhal, A Successful Algorithm for Solving Directed Hamiltonian Path Problems,Operations Research Letters,3(12):35\u201342 (April 1984).","journal-title":"Operations Research Letters"},{"key":"BF02427853_CR6","unstructured":"M. O. Rabin, Probabilistic Algorithms, inAlgorithms and Complexity, J.F. Traub (ed.), Academic Press, pp. 21\u201339 (1976)."},{"key":"BF02427853_CR7","doi-asserted-by":"crossref","unstructured":"D. Vrsalovic, D. P. Siewiorek, Z. Z. Segall, and E. F. Gehringer, Performance Prediction for Multiprocessor Systems, inProc. 13th Intl. Conf. on Parallel Processing, pp. 139\u2013146 (August 1984).","DOI":"10.1145\/327070.327372"},{"key":"BF02427853_CR8","unstructured":"G. M. Baudet, The Design and Analysis of Algorithms for Asynchronous Multiprocessors, Ph.D. thesis, Technical Report CMU-CS-78-116, Carnegie-Mellon University Department of Computer Science (April 1978)."},{"key":"BF02427853_CR9","doi-asserted-by":"crossref","unstructured":"E. F. Gehringer, A. K. Jones, and Z. Z. Segall, The Cm* Testbed,IEEE Computer, pp. 40\u201353 (October 1982).","DOI":"10.1109\/MC.1982.1653858"},{"key":"BF02427853_CR10","unstructured":"V. K. Janakiram, D. P. Agrawal, and R. Mehrotra, Randomized Parallel Algorithms for PROLOG Programs and Backtracking Applications, inProc. 1987 Intl. Conf. on Parallel Processing, Chicago, Illinois, pp. 278\u2013282 (1987)."},{"issue":"3","key":"BF02427853_CR11","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1147\/rd.303.0242","volume":"30","author":"H. S. Stone","year":"1986","unstructured":"H. S. Stone and P. Sipala, The Average Complexity of Depth-First Search with Backtracking and Cutoff,IBM J. of Res and Development,30(3):242\u2013258 (May 1986).","journal-title":"IBM J. of Res and Development"},{"key":"BF02427853_CR12","volume-title":"Integer Programming","author":"R. S. Garfinkel","year":"1972","unstructured":"R. S. Garfinkel and A. L. Nemhauser,Integer Programming, New York, John Wiley & Sons, Inc. (1972)."},{"key":"BF02427853_CR13","doi-asserted-by":"crossref","unstructured":"B. Lagewes, J. Lenston, and A. Rennooy Kan, Job-shop Scheduling by Implicit Enumeration,Management Science,24(4) (1977).","DOI":"10.1287\/mnsc.24.4.441"},{"issue":"4","key":"BF02427853_CR14","first-page":"460","volume":"20","author":"G. Ingangiole","year":"1973","unstructured":"G. Ingangiole and J. Korsh, A Reduction Algorithm for Zero-one Single Knapsack Problems,Management Science,20(4):460\u2013663 (1973).","journal-title":"Management Science"},{"issue":"5","key":"BF02427853_CR15","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1287\/opre.25.5.752","volume":"25","author":"G. Ingangiole","year":"1977","unstructured":"G. Ingangiole and J. Korsh, A General Algorithm for One-dimensional Knapsack Problems,Operations Research,25(5):752\u2013759 (1977).","journal-title":"Operations Research"},{"issue":"9","key":"BF02427853_CR16","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.21.1.340","volume":"21","author":"R. Garfinkel","year":"1973","unstructured":"R. Garfinkel, On Partitioning the Feasible Set in a Branch-and-bound Algorithm for the Asymmetric Traveling Salesman Problem,Operations Research,21(9):340\u2013342 (1973).","journal-title":"Operations Research"},{"key":"BF02427853_CR17","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1287\/opre.14.3.361","volume":"14","author":"A. Efroymson","year":"1966","unstructured":"A. Efroymson and T. C. Ray, A Branch-and-bound Algorithm for Plant Location,Operations Research,14:361\u2013368 (1966).","journal-title":"Operations Research"},{"issue":"9","key":"BF02427853_CR18","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1287\/mnsc.18.9.465","volume":"18","author":"A. M. Geoffrion","year":"1972","unstructured":"A. M. Geoffrion and R. E. Marston, Integer Programming Algorithms: A Framework and State-of-the-art Survey,Management Science,18(9):465\u2013491 (May 1972).","journal-title":"Management Science"},{"key":"BF02427853_CR19","unstructured":"T. Lai and S. Sahni, Anomalies in Parallel Branch-and-bound Algorithms, inProc. 1983 Intl. Conf. Parallel Processing, Bellaire, Michigan, pp. 183\u2013190 (1983)."},{"issue":"5","key":"BF02427853_CR20","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/TC.1984.1676453","volume":"33","author":"B. W. Wah","year":"1984","unstructured":"B. W. Wah and Y. W. Eva Ma, MANIP\u2014A Multicomputer Architecture for Solving Combinatorial Extremum-search Problems,IEEE Trans. on Computers,C-33(5):377\u2013390 (May 1984).","journal-title":"IEEE Trans. on Computers, C"},{"key":"BF02427853_CR21","unstructured":"B. W. Wah and C. F. Yu, Probabilistic Modelling of Branch and Bound Algorithms, inProc. of the COMPSAC, pp. 647\u2013653 (1982)."},{"issue":"9","key":"BF02427853_CR22","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/TC.1980.1675681","volume":"29","author":"O. I. El-Dessouki","year":"1980","unstructured":"O. I. El-Dessouki and W. H. Huen, Distributed Enumeration on Network Computers,IEEE Transactions on Computers,C-29(9):818\u2013825 (Sept. 1980).","journal-title":"IEEE Transactions on Computers, C"},{"issue":"1","key":"BF02427853_CR23","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/2422.322422","volume":"31","author":"D. R. Smith","year":"1984","unstructured":"D. R. Smith, Random Trees and the Analysis of Branch-and-bound Procedures.J. ACM,31(1):163\u2013188 (January 1984).","journal-title":"J. ACM"},{"issue":"9","key":"BF02427853_CR24","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/TSE.1985.232550","volume":"11","author":"B. W. Wah","year":"1985","unstructured":"B. W. Wah and C. F. Yu, Stochastic Modeling of Branch-and-bound Algorithms with Best-first Search,IEEE Trans. on Software Eng.,SE-11(9):922\u2013933 (September 1985).","journal-title":"IEEE Trans. on Software Eng., SE"},{"key":"BF02427853_CR25","volume-title":"Gaussian Quadrature Formulas","author":"A. H. Stroud","year":"1966","unstructured":"A. H. Stroud and D. Secrest,Gaussian Quadrature Formulas, New Jersey, Prentice-Hall (1966)."},{"key":"BF02427853_CR26","volume-title":"Asymptotic Methods in Analysis","author":"N. G. De Bruijn","year":"1961","unstructured":"N. G. De Bruijn,Asymptotic Methods in Analysis, Amsterdam, North Holland Publishing Co. (1961)."},{"key":"BF02427853_CR27","volume-title":"An Introduction to Probability Theory and Applications","author":"W. Feller","year":"1971","unstructured":"W. Feller,An Introduction to Probability Theory and Applications, New York, Wiley (1971)."},{"key":"BF02427853_CR28","series-title":"Tech. Rep. UCID","volume-title":"A Multitasking Kernal for the C and Fortran Programming Languages","author":"E. D. Brooks","year":"1984","unstructured":"E. D. Brooks, A Multitasking Kernal for the C and Fortran Programming Languages, Tech. Rep. UCID 20167, Lawerence Livermore National Laboratory, Livermore, California (September 1984)."},{"key":"BF02427853_CR29","volume-title":"Fundamentals of Computer Algorithms","author":"E. Horowitz","year":"1984","unstructured":"E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms, Maryland, Computer Science Press (1984)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02427853.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02427853\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02427853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02427853.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T21:09:37Z","timestamp":1652562577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02427853"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["BF02427853"],"URL":"https:\/\/doi.org\/10.1007\/bf02427853","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}