{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:34Z","timestamp":1759847374676,"version":"3.40.2"},"reference-count":23,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T00:00:00Z","timestamp":1349049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1016\/j.future.2012.03.001","type":"journal-article","created":{"date-parts":[[2012,3,16]],"date-time":"2012-03-16T23:50:01Z","timestamp":1331941801000},"page":"1168-1176","source":"Crossref","is-referenced-by-count":8,"title":["Hierarchical branch and bound algorithm for computational grids"],"prefix":"10.1016","volume":"28","author":[{"given":"A.","family":"Bendjoudi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Melab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.-G.","family":"Talbi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Commpleteness","author":"Garey","key":"10.1016\/j.future.2012.03.001_br000005"},{"issue":"3","key":"10.1016\/j.future.2012.03.001_br000010","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1016\/j.future.2006.09.001","article-title":"A parallel hybrid genetic algorithm for protein structure prediction on the computational grid","volume":"23","author":"Tantar","year":"2007","journal-title":"Future Generation Computer Systems (FGCS)"},{"key":"10.1016\/j.future.2012.03.001_br000015","unstructured":"J.-P. Goux, J. Linderoth, M. Yoder, Metacomputing and the master\u2013worker paradigm, in: Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, 2000, Preprint MCS\/ANL-P792-0200."},{"issue":"12","key":"10.1016\/j.future.2012.03.001_br000020","first-page":"193","article-title":"Parallel branch and bound algorithm with the hierarchical master\u2013worker paradigm on the grid(grid)","volume":"47","author":"Aida","year":"2006","journal-title":"IPSJ Transactions on High Performance Computing Systems"},{"key":"10.1016\/j.future.2012.03.001_br000025","doi-asserted-by":"crossref","unstructured":"K. Aida, W. Natsume, Y. Futakata, Distributed computing with hierarchical master\u2013worker paradigm for parallel branch and bound algorithm, in: IEEE International Symposium on Cluster Computing and the Grid, vol. 0, 2003, p. 156.","DOI":"10.1109\/CCGRID.2003.1199364"},{"key":"10.1016\/j.future.2012.03.001_br000030","unstructured":"A. di Costanzo, L. Baduel, D. Caromel, S. Matsuoka, Grid\u2019BnB: a parallel branch and bound framework for grids, in: Procedings of the 13th International Conference on High Performance Computing, Goa, India, December 2007."},{"issue":"2","key":"10.1016\/j.future.2012.03.001_br000035","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/22719.24067","article-title":"Dib\u2014a distributed implementation of backtracking","volume":"9","author":"Finkel","year":"1987","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/j.future.2012.03.001_br000040","doi-asserted-by":"crossref","unstructured":"A. Iamnitchi, A problem-specific fault-tolerance mechanism for asynchronous, distributed systems, in: Proceedings of the International Conference on Parallel Processing 2000, 2000, pp. 4\u201314.","DOI":"10.1109\/ICPP.2000.876065"},{"key":"10.1016\/j.future.2012.03.001_br000045","series-title":"Fifteen Euromicro Conference on Parallel, Distributed and Network-Based Processing","article-title":"A grid-based parallel approach of the multi-objective branch and bound","author":"Mezmaz","year":"2007"},{"key":"10.1016\/j.future.2012.03.001_br000050","series-title":"Proc. of 21th IEEE Intl. Parallel and Distributed Processing Symposium","article-title":"A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems","author":"Mezmaz","year":"2007"},{"key":"10.1016\/j.future.2012.03.001_br000055","doi-asserted-by":"crossref","unstructured":"Z. Dai, F. Viale, X. Chi, D. Caromel, Z. Lu, A task-based fault-tolerance mechanism to hierarchical master\/worker with divisible tasks, in: 10th IEEE International Conference on High Performance Computing and Communications, vol. 0, 2009, pp. 672\u2013677.","DOI":"10.1109\/HPCC.2009.35"},{"issue":"06","key":"10.1016\/j.future.2012.03.001_br000065","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":"11","key":"10.1016\/j.future.2012.03.001_br000070","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/581571.581573","article-title":"SETI@home: an experiment in public-resource computing","volume":"45","author":"Anderson","year":"2002","journal-title":"Communications of the ACM"},{"issue":"4","key":"10.1016\/j.future.2012.03.001_br000075","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1016\/j.future.2011.11.006","article-title":"A new step toward load balancing based on competency rank and transitional phases in grid networks","volume":"28","author":"Khanli","year":"2012","journal-title":"Future Generation Computer Systems (FGCS)"},{"key":"10.1016\/j.future.2012.03.001_br000080","doi-asserted-by":"crossref","unstructured":"Y. Xu, T.K. Ralphs, L. Lada\u2019nyi, M.J. Saltzman, Alps: a framework for implementing parallel search algorithms, in: Proceedings of the Ninth INFORMS Computing Society Conference, 2005, pp. 319\u2013334.","DOI":"10.1007\/0-387-23529-9_21"},{"key":"10.1016\/j.future.2012.03.001_br000085","doi-asserted-by":"crossref","unstructured":"J. Eckstein, C.A. Phillips, W.E. Hart, PICO: an object-oriented framework for parallel branch and bound, Technical Report, Rutgers University, Piscataway, NJ, 2000.","DOI":"10.2172\/771506"},{"key":"10.1016\/j.future.2012.03.001_br000090","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.parco.2005.09.006","article-title":"A grid-enabled distributed branch-and-bound algorithm with application on the steiner problem in graphs","volume":"32","author":"Drummond","year":"2006","journal-title":"Parallel Computing"},{"issue":"2","key":"10.1016\/j.future.2012.03.001_br000095","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1504\/IJGUC.2009.022031","article-title":"P2P design and implementation of a parallel branch and bound algorithm for grids","volume":"1","author":"Bendjoudi","year":"2009","journal-title":"International Journal of Grid and Utility Computing"},{"issue":"2","key":"10.1016\/j.future.2012.03.001_br000100","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.future.2007.03.011","article-title":"A grid-aware MIP solver: implementation and case studies","volume":"24","author":"Mancini","year":"2008","journal-title":"Future Generation Computer Systems (FGCS)"},{"issue":"1","key":"10.1016\/j.future.2012.03.001_br000105","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.26.1.53","article-title":"A general boundind scheme for the permutation flow-shop problem","volume":"26","author":"Lenstra","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/j.future.2012.03.001_br000115","series-title":"Grid Computing: Software Environments","article-title":"Programming, composing, deploying for the grid","author":"Baduel","year":"2006"},{"issue":"1","key":"10.1016\/j.future.2012.03.001_br000120","doi-asserted-by":"crossref","first-page":"69","DOI":"10.12921\/cmst.2006.12.01.69-77","article-title":"ProActive: an integrated platform for programming and running applications on grids and P2P systems","volume":"12","author":"Caromel","year":"2006","journal-title":"Computational Methods in Science and Technology"},{"key":"10.1016\/j.future.2012.03.001_br000125","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European Journal of Operational Research"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167739X12000544?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167739X12000544?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T11:19:19Z","timestamp":1742728759000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X12000544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":23,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["S0167739X12000544"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2012.03.001","relation":{},"ISSN":["0167-739X"],"issn-type":[{"type":"print","value":"0167-739X"}],"subject":[],"published":{"date-parts":[[2012,10]]}}}