[1] Chakroun, I., Melab, N., Operator-level GPU-accelerated branch and bound algorithms. Proceedings of the International Conference on Computational Science, ICCS, 5–7 June, 2013, Barcelona, Spain, 2013, 280–289, 10.1016/j.procs.2013.05.191.
[2] Carneiro, T., Muritiba, A., Negreiros, M., Lima de Campos, G., A new parallel schema for branch-and-bound algorithms using GPGPU. Proceedings of the 23rd International Symposium on Computer Architecture and High Performance Computing, SBAC-PAD, 2011, 41–47, 10.1109/SBAC-PAD.2011.20.
[3] Lalami, M., El-Baz, D., GPU implementation of the branch and bound method for the knapsack problems. Proceedings of the 2012 IEEE 26th International Symposium Workshops on Parallel and Distributed Processing, IPDPSW ’12, 2012, IEEE, 1769–1777, 10.1109/IPDPSW.2012.219.
[4] Melab, N., Chakroun, I., Bendjoudi, A., Graphics processing unit-accelerated bounding for branch-and-bound applied to a permutation problem using data access optimization. Concurr. Comput. Pract. Exp. 26:16 (2014), 2667–2683.
[5] Leroy, R., Mezmaz, M., Melab, N., Tuyttens, D., Work stealing strategies for multi-core parallel branch-and-bound algorithm using factorial number system. Proceedings of Programming Models and Applications on Multicores and Manycores, PMAM'14, 2007, ACM, New York, NY, USA, 111:111–111:119, 10.1145/2560683.2560694.
[6] Mezmaz, M., Leroy, R., Tuyttens, D., Melab, N., A multi-core parallel branch-and-bound algorithm using factorial number system. Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, IPDPS ’14, 2014, IEEE, 10.1109/IPDPS.2014.124.
[7] Goldengorin, B., Ghosh, D., Sierksma, G., Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 31 (2004), 241–255.
[8] Pastor, R., Corominas, A., Branch and win: Or tree search algorithms for solving combinatorial optimisation problems. Top 1 (2004), 169–192.
[9] Climer, S., Zhang, W., Cut-and-solve: an iterative search strategy for combinatorial optimization problems. Artif. Intell. 170 (2006), 714–738.
[10] N. Melab, Contributions à la Résolution de Problèmes d'optimisation Combinatoire sur Grilles de Calcul, 2005, LIFL, USTL, Thèse HDR.
[12] Gendron, B., Crainic, T., Parallel branch and bound algorithms: survey and synthesis. Oper. Res. 42 (1994), 1042–1066.
[13] Mezmaz, M., Melab, N., Talbi., E.-G., A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems. Proceedings of the 21th IEEE International Parallel and Distributed Processing Symposium, IPDPS, Long Beach, California, 2007.
[14] Chakroun, I., Mezmaz, M., Melab, N., Bendjoudi, A., Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm. Concurr. Comput. Pract. Exp. 25:8 (2013), 1121–1136, 10.1002/cpe.2931.
[15] G. Cantor, Ueber die Einfachen Zahlensysteme, Zeitschrift für Mathematik und Physik 14, B. G. Teubner, Leipzig, Germany, 1869.
[16] Laisant, C.-A., Sur la numération factorielle, application aux permutations. Bull. Soc. Math. Fr. 16 (1888), 176–183.
[17] Knuth, D., The Art of Computer Programming (vol. 2: Seminumerical Algorithms), Reading, MA, 1997, Addison-Wesley, 192 ISBN=9780201896848.
[18] J. McCaffrey, Using Permutations in.NET for Improved Systems Security, 2003. https://msdn.microsoft.com/en-us/library/aa302371.aspx. (accessed 05.02.16).
[19] Chakroun, I., Parallel Heterogeneous Branch and Bound Algorithms for Multi-core and Multi-GPU Environments, 2013, Université Lille 1 (Ph.D. thesis).
[20] Xiao, S., Feng, W.-c., Inter-block GPU communication via fast barrier synchronization. Proceedings of the 2010 IEEE International Symposium on Parallel Distributed Processing, IPDPS, 2010, 1–12, 10.1109/IPDPS.2010.5470477.
[21] Lageweg, B., Lenstra, J.K., Kan, A.R., A general bounding scheme for the permutation flow-shop problem. Oper. Res. 26:1 (1978), 53–67.
[22] Johnson, S., Optimal two and three-stage production schedules with setup times included. Nav. Res. Logist. Q. 1 (1954), 61–68.
[23] Harris, M., Sengupta, S., Owens, J.D., Parallel prefix sum (scan) with cuda. Nguyen, H., (eds.) GPU Gems 3, 2007, Addison Wesley.
[24] Saraswat, V.A., Kambadur, P., Kodali, S., Grove, D., Krishnamoorthy, S., Lifeline-based global load balancing. Proceedings of the 16th Symposium on Principles and pPatice of Parallel Programming, PPoPP ’11, 2011, ACM, New York, NY, USA, 201–212, 10.1145/1941553.1941582.
[25] Garey, M., Johnson, D., Sethi, R., The complexity of flow-shop and job-shop scheduling. Math. Oper. Res. 1 (1976), 117–129.
[26] Taillard, E., Benchmarks for basic scheduling problems. J. Oper. Res. 64 (1993), 278–285.
