M. J. Quinn, Analysis and implementation of branch-and-bound algorithms on a hypercube multicomputer, IEEE Transactions on Computers, vol.39, issue.3, pp.6144-8192
DOI : 10.1109/12.48868

J. K. Lenstra, B. J. Lenstra, and A. H. Kan, A general bounding scheme for the permutation flow-shop problem, Operations Research, vol.26, issue.1, pp.53-67, 1978.

M. Mezmaz, N. Melab, and E. Talbi, A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems, 2007 IEEE International Parallel and Distributed Processing Symposium, 2007.
DOI : 10.1109/IPDPS.2007.370217
URL : https://hal.archives-ouvertes.fr/inria-00083814

R. Allen, L. Cinque, S. Tanimoto, L. Shapiro, and D. Yasuda, A parallel algorithm for graph matching and its MasPar implementation, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.5, 1997.
DOI : 10.1109/71.598276

L. G. Casadoa, J. A. Martneza, I. Garcaa, and E. M. Hendrixb, Branch-and-Bound interval global optimization on shared memory multiprocessors, Optimization Methods and Software, vol.23, issue.5, pp.689-701, 2008.
DOI : 10.1080/10556780802086300

M. Djamai, B. Derbel, and N. Melab, Distributed B&B: A Pure Peer-to-Peer Approach, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, 2011.
DOI : 10.1109/IPDPS.2011.337

T. Luong, N. Melab, and E. Talbi, GPU Computing for Parallel Local Search Metaheuristic Algorithms, IEEE Transactions on Computers, 2011.

A. Boukedjar, M. Lalami, and D. Baz, Parallel Branch and Bound on a CPU-GPU System, 2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing, pp.15-17392, 2012.
DOI : 10.1109/PDP.2012.23
URL : https://hal.archives-ouvertes.fr/hal-01152948

B. Gendron and T. G. Crainic, Parallel Branch-and-Branch Algorithms: Survey and Synthesis, Operations Research, vol.42, issue.6, pp.1042-1066, 1994.
DOI : 10.1287/opre.42.6.1042

I. Chakroun, A. Bendjoudi, and N. Melab, Reducing Thread Divergence in GPU-Based B&B Applied to the Flow-Shop Problem, LNCS Proc. of 9th Intl. Conf. on Parallel Processing and Applied Mathematics (PPAM), 2011.
DOI : 10.1007/978-3-642-31464-3_57
URL : https://hal.archives-ouvertes.fr/hal-00640805

S. Tschoke, R. Lubling, and B. Monien, Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network, Proceedings of 9th International Parallel Processing Symposium, pp.182-189, 1995.
DOI : 10.1109/IPPS.1995.395930