W. Zhang, Branch-and-bound search algorithms and their computational complexity, DTIC Document, Tech. Rep, 1996.

A. Y. Grama and V. Kumar, A survey of parallel search algorithms for discrete optimization problems, ORSA Journal on Computing, vol.7, 1993.

P. Segundo, C. Rossi, and D. Rodriguez-losada, Recent developments in bit-parallel algorithms, 2008.

T. Pessoa, J. Gmys, F. H. De-carvalho-junior, N. Melab, and D. Tuyttens, GPU-accelerated backtracking using CUDA dynamic parallelism, Concurrency and Computation: Practice and Experience, p.2017
URL : https://hal.archives-ouvertes.fr/hal-01648125

J. Gmys, M. Mezmaz, N. Melab, and D. Tuyttens, Ivm-based parallel branch-and-bound using hierarchical work stealing on multi-gpu systems, Concurrency and Computation: Practice and Experience, vol.29, issue.9, p.4019, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01673376

G. Costa, T. Fahringer, J. A. Gallego, I. Grasso, A. Hristov et al., Exascale machines require new programming paradigms and runtimes, Supercomputing frontiers and innovations, vol.2, issue.2, pp.6-27, 2015.

E. Lusk and K. Yelick, Languages for high-productivity computing: the darpa hpcs language project, Parallel Processing Letters, vol.17, issue.01, pp.89-102, 2007.

T. Carneiro, F. H. De-carvalho-júnior, N. G. Arruda, and A. B. Pinheiro, Um levantamento na literatura sobre a resolução de problemas de otimização combinatória através do uso de aceleradores gráficos, Proceedings of the XXXV Ibero-Latin American Congress on Computational Methods in Engineering (CILAMCE), 2014.

T. Crainic, B. L. Cun, and C. Roucairol, Parallel branch-and-bound algorithms, pp.1-28, 2006.

B. L. Chamberlain, E. Ronaghan, B. Albrecht, L. Duncan, M. Ferguson et al., Chapel comes of age: Making scalable programming productive, 2018.

C. Inc, Chapel language specification v.986, 2018.

G. Almasi, Pgas (partitioned global address space) languages, Encyclopedia of Parallel Computing, pp.1539-1545, 2011.

B. L. Chamberlain, S. Choi, S. J. Deitz, and A. Navarro, Userdefined parallel zippered iterators in chapel, Proceedings of Fifth Conference on Partitioned Global Address Space Programming Models, pp.1-11, 2011.

F. Feinbube, B. Rabe, M. Löwis, and A. Polze, Nqueens on cuda: Optimization issues, Parallel and Distributed Computing (ISPDC), pp.63-70, 2010.

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

M. Mezmaz, N. Melab, and E. Talbi, A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems, IEEE International Parallel and Distributed Processing Symposium, pp.1-9, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00841951

J. Bell and B. Stevens, A survey of known results and research areas for n-queens, Discrete Mathematics, vol.309, issue.1, pp.1-31, 2009.

P. A. Nelson and G. Titus, Chplvis: A communication and task visualization tool for chapel, Parallel and Distributed Processing Symposium Workshops, pp.1578-1585, 2016.

R. Bolze, F. Cappello, E. Caron, M. Dayde, F. Desprez et al., Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed, International Journal of High Performance Computing Applications, vol.20, issue.4, pp.481-494, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00684943