J. Wang and S. Yalamanchili, Characterization and analysis of dynamic parallelism in unstructured GPU applications, 2014 IEEE International Symposium on Workload Characterization (IISWC), pp.51-60, 2014.

S. S. Mukherjee, S. D. Sharma, M. D. Hill, J. R. Larus, A. Rogers et al., Efficient support for irregular applications on distributed-memory machines, ACM SIGPLAN Notices, vol.30, pp.68-79, 1995.

K. A. Yelick, Programming models for irregular applications, ACM SIGPLAN Notices, vol.28, issue.1, pp.28-31, 1993.

B. Gendron and T. G. Crainic, Parallel branch-and-bound algorithms: Survey and synthesis, Operations Research, vol.42, issue.6, pp.1042-1066, 1994.

A. Brodtkorb, C. Dyken, T. Hagen, J. Hjelmervik, and O. Storaasli, State-of-the-art in heterogeneous computing, Scientific Programming, vol.18, issue.1, pp.1-33, 2010.

A. Adinetz, CUDA dynamic parallelism: API and principles, pp.2018-2023, 2014.

C. Pessoa, T. Gmys, J. De-carvalho-junior, F. H. Melab, N. Tuyttens et al., GPU-accelerated backtracking using CUDA dynamic parallelism. Concurrency and Computation: Practice and Experience (2017) e4374-n/a 8. NVIDIA: CUDA C programming guide, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01919514

W. Cook, In pursuit of the traveling salesman: mathematics at the limits of computation, 2012.

J. Cirasella, D. Johnson, L. Mcgeoch, and W. Zhang, The asymmetric traveling salesman problem: Algorithms, instance generators, and tests, Algorithm Engineering and Experimentation, pp.32-59, 2001.

M. Plauth, F. Feinbube, F. Schlegel, and A. Polze, A performance evaluation of dynamic parallelism for fine-grained, irregular workloads, International Journal of Networking and Computing, vol.6, issue.2, pp.212-229, 2016.

T. Zhang, W. Shu, and M. Y. Wu, Optimization of N-Queens solvers on graphics processors, International Workshop on Advanced Parallel Processing Technologies, pp.142-156, 2011.

P. Zhang, E. Holk, J. Matty, S. Misurda, M. Zalewski et al., Dynamic parallelism for simple and efficient GPU graph algorithms, Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms, p.11, 2015.

J. Dimarco and M. Taufer, Performance impact of dynamic parallelism on different clustering algorithms and the new GPU architecture, Proceedings of SPIE Defense, Security, and Sensing Symposium, 2013.

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

F. Feinbube, B. Rabe, M. Von-löwis, and A. Polze, NQueens on CUDA: Optimization issues, Ninth International Symposium on Parallel and Distributed Computing (ISPDC), pp.63-70, 2010.
DOI : 10.1109/ispdc.2010.22

T. Carneiro, A. Muritiba, M. Negreiros, and G. De-campos, A new parallel schema for branch-and-bound algorithms using GPGPU, 23rd International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), pp.41-47, 2011.
DOI : 10.1109/sbac-pad.2011.20

G. Karypis and V. Kumar, Unstructured tree search on SIMD parallel computers, IEEE Transactions on Parallel and Distributed Systems, vol.5, issue.10, pp.1057-1072, 1994.
DOI : 10.1109/71.313122