{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T09:51:17Z","timestamp":1760521877997},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0167-8191(99)00094-0","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T08:06:40Z","timestamp":1051258000000},"page":"27-46","source":"Crossref","is-referenced-by-count":36,"title":["Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem"],"prefix":"10.1016","volume":"26","author":[{"given":"Beno\u0131\u0302t","family":"Bourbeau","sequence":"first","affiliation":[]},{"given":"Teodor","family":"Gabriel Crainic","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1993","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","key":"10.1016\/S0167-8191(99)00094-0_BIB1"},{"key":"10.1016\/S0167-8191(99)00094-0_BIB2","doi-asserted-by":"crossref","unstructured":"G.M. Amdahl, Validity of the single processor approach to achieving large scale computing capabilities, in: AFIPS Conference Proceedings, 1967, pp. 483\u2013485","DOI":"10.1145\/1465482.1465560"},{"key":"10.1016\/S0167-8191(99)00094-0_BIB3","unstructured":"G. Authi\u00e9, M. Elkihel, F. Viader, A parallel best-first branch-and-bound algorithm for 0\u20131 problems: single pool and multiple pool implementations, Report LAAS 96155, Laboratoire d'analyse et d'architecture des syst\u00e8mes, CNRS, Toulouse, 1996"},{"key":"10.1016\/S0167-8191(99)00094-0_BIB4","unstructured":"B. Bourbeau, Approches de parall\u00e9lisation bas\u00e9es sur l'organisation de la m\u00e9moire pour des m\u00e9thodes de s\u00e9paration et \u00e9valuation progressive, M.Sc. Thesis, D\u00e9partement d'informatique et de recherche op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, publication CRT-98-18, Centre de recherche sur les transports, Montr\u00e9al, 1998"},{"key":"10.1016\/S0167-8191(99)00094-0_BIB5","doi-asserted-by":"crossref","unstructured":"J. Clausen, M. Perregaard, On the best search strategy in parallel branch-and-bound \u2013 best-first search vs. lazy depth-first-search, Annals of Operations Research 90 (1999) 1\u201317","DOI":"10.1023\/A:1018952429396"},{"key":"10.1016\/S0167-8191(99)00094-0_BIB6","unstructured":"G. Cornu\u00e9jols, G.L. Nemhauser, L.A. Wolsey, The uncapacitated facility location problem, in: R.L. Francis, P.B. Mirchandani (Eds.), Discrete Location Theory, Wiley\/Interscience, New York, 1990, pp. 119\u2013168"},{"key":"10.1016\/S0167-8191(99)00094-0_BIB7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02097809","article-title":"Models for multimode multicommodity location problems with interdepot balancing requirements","volume":"18","author":"Crainic","year":"1989","journal-title":"Annals of Operations Research"},{"issue":"3","key":"10.1016\/S0167-8191(99)00094-0_BIB8","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/0377-2217(93)90117-6","article-title":"A branch-and-bound method for multicommodity location with balancing requirements","volume":"65","author":"Crainic","year":"1993","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0167-8191(99)00094-0_BIB9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1008699010646","article-title":"Distributed versus centralized storage and control for parallel branch and bound: mixed integer programming on the CM-5","volume":"7","author":"Eckstein","year":"1997","journal-title":"Computational Optimization and Applications"},{"issue":"6","key":"10.1016\/S0167-8191(99)00094-0_BIB10","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","article-title":"A dual-based procedure for uncapacitated facility location","volume":"26","author":"Erlenkotter","year":"1978","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0167-8191(99)00094-0_BIB11","first-page":"151","article-title":"Parallel implementations of a branch-and-bound algorithm for multicommodity location with balancing requirements","volume":"31","author":"Gendron","year":"1993","journal-title":"INFOR"},{"issue":"6","key":"10.1016\/S0167-8191(99)00094-0_BIB12","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","article-title":"Parallel branch-and-bound algorithms: survey and synthesis","volume":"42","author":"Gendron","year":"1994","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/S0167-8191(99)00094-0_BIB13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0966-8349(95)00005-3","article-title":"A branch-and-bound algorithm for depot location and container fleet management","volume":"3","author":"Gendron","year":"1995","journal-title":"Location Science"},{"issue":"9","key":"10.1016\/S0167-8191(99)00094-0_BIB14","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1016\/S0305-0548(96)00094-9","article-title":"A parallel branch-and-bound algorithm for multicommodity location with balancing requirements","volume":"24","author":"Gendron","year":"1997","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0167-8191(99)00094-0_BIB15","doi-asserted-by":"crossref","unstructured":"B. Gendron, T.G. Crainic, A. Frangioni, Multicommodity capacitated network design, in: B. Sans\u00f3, P. Soriano (Eds.), Telecommunications Network Planning, Kluwer Academics Publishers, Dordrecht, 1998, pp. 1\u201319","DOI":"10.1007\/978-1-4615-5087-7_1"},{"key":"10.1016\/S0167-8191(99)00094-0_BIB16","first-page":"10","article-title":"Enumerative approaches to combinatorial optimization","author":"Ibaraki","year":"1987","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0167-8191(99)00094-0_BIB17","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","article-title":"The simple plant location problem: survey and synthesis","volume":"12","author":"Krarup","year":"1983","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0167-8191(99)00094-0_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","article-title":"Network design and transportation planning: models and algorithms","volume":"18","author":"Magnanti","year":"1984","journal-title":"Transportation Science"},{"key":"10.1016\/S0167-8191(99)00094-0_BIB19","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF02073942","article-title":"Branch-and-bound as a higher-order function","volume":"33","author":"McKeown","year":"1991","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0167-8191(99)00094-0_BIB20","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","article-title":"Network synthesis and optimum network design problems: models, solution methods and applications","volume":"19","author":"Minoux","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0167-8191(99)00094-0_BIB21","doi-asserted-by":"crossref","unstructured":"J. Mohan, A study in parallel computation: the traveling salesman problem, Report CMU-CS-82-136(R), Computer Science Department, Carnegie-Mellon University, Pittsburgh, 1982","DOI":"10.21236\/ADA123327"},{"issue":"3","key":"10.1016\/S0167-8191(99)00094-0_BIB22","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/12.48868","article-title":"Analysis and implementation of branch-and-bound algorithms on a hypercube multicomputer","volume":"39","author":"Quinn","year":"1990","journal-title":"IEEE Transactions on Computers"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000940?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000940?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T13:45:59Z","timestamp":1579182359000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819199000940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0167819199000940"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(99)00094-0","relation":{},"ISSN":["0167-8191"],"issn-type":[{"type":"print","value":"0167-8191"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}