{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:27Z","timestamp":1725664407710},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584308"},{"type":"electronic","value":"9783540487890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58430-7_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:03:50Z","timestamp":1330272230000},"page":"359-370","source":"Crossref","is-referenced-by-count":1,"title":["Comparing two probabilistic models of the computational complexity of the branch and bound algorithm"],"prefix":"10.1007","author":[{"given":"Mich\u00e8le","family":"Dion","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Gengler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Ub\u00e9da","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"32_CR1","unstructured":"Garey, M. R., Johnson, D. S.: Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"32_CR2","first-page":"515","volume":"634","author":"M. Gengler","year":"1992","unstructured":"Gengler, M., Coray, G.: A Parallel Best-first B&B with Synchronization Phases. Proceedings CONPAR'92-VAPP V, LNCS 634 (1992) 515\u2013526","journal-title":"LNCS"},{"key":"32_CR3","first-page":"263","volume":"2","author":"M. Gengler","year":"1993","unstructured":"Gengler, M., Coray, G.: A Parallel Best-first B&B Algorithm and its Axiomatization. IEEE Proceedings HICSS-26, Vol. 2 (1993) 263\u2013272","journal-title":"IEEE Proceedings HICSS-26"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Johnson, D. S.: A Catalog of Complexity Classes. Algorithms and Complexity Vol. A, J. Van Leeuwen (ed.), Elsevier & MIT Press (1990) 67\u2013161","DOI":"10.1016\/B978-0-444-88071-0.50007-2"},{"key":"32_CR5","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.: Branch and Bound Methods: General Formulation and Properties. Operations Research 18 (1970) 24\u201334","journal-title":"Operations Research"},{"key":"32_CR6","unstructured":"Rinnooy Kan, A. H. G.: On Mitten's Axioms for Branch and Bound. Graduate School of Management, Delft, Tech. Rep. W\/74\/45\/03 (1974)"},{"key":"32_CR7","unstructured":"Quinn, M. J.: Designing Efficient Algorithms for Parallel Computers. McGraw-Hill (1987)"},{"key":"32_CR8","unstructured":"Wah, B. W., Yu, C. F.: Probabilistic Modeling of Branch and Bound Algorithms. Proceedings COMPSAC (1982) 647\u2013653"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing: CONPAR 94 \u2014 VAPP VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58430-7_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:15:36Z","timestamp":1619572536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58430-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584308","9783540487890"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-58430-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}